###### Data Structures C++ Programing

## Doubly Circular Linked List C/C++

Doubly Circular LInked List is a linked list in which last node points to the first node and first node points to the last node with next and prev pointers.

Doubly Circular LInked List is a linked list in which last node points to the first node and first node points to the last node with next and prev pointers.

Circular Linked List is a linked list in which the last node points to the first node of the list instead of the null value thus makes it circular.

Array is a linear data structure which stores similar type of data. e.g. it can only store int data type or char data type. Array C++

Doubly Linked List C++ is a linked list in which we traverse both backward and forward. It has two pointers *Next point to Next & *Prev to Previous Node.

Linked list C++ learn easily step by step . Singly Linked list is a list in which nodes are connected by pointers dynamically which will grow at run time.