Some basic of Linked list

Linked list in Data structure 

Definition: The linked list is a linear collection of data elements Where have some nodes. Here each node contains data, the previous node address, and the next node address. Where next or previous data and data address store by the pointer. 

These three types of linked lists.

1. Singly linked list

2. Doubly linked list

3. Circle linked list

Singly-linked list:  Basically there have two-part 

1. First part contains Data

2. Second part contains the Next node address of data.

Like this:    

Doubly linked list: Basically there have three parts.

1. The first part contains the Previous node address.

2. The second part contains the Data 

3. And third part contains the Next node address

Like this:  

Circle linked list: Circular linked list is a linked list where all nodes are connected to form a circle. There is no NULL at the end. A circular linked list can be a singly circular linked list or a doubly circular linked list.

For an example of Circle linked list: