Linked List

• Linked List is a data structure that consists of a sequence of data records where each record has a field that stores the address / reference of the next record (in sequence).

• Data elements that are linked to links on a Linked List are called Nodes.

• Usually in a linked list, there are the terms head and tail:

-Head is the element that is in the first position in a linked list.

-Tail is the element that is in the last position in a linked list.

• Several type of linked list:

1. Single Linked List
2. Double Linked List
3. Circular Linked List
4. Multiple Linked List

Circular Linked List

Circular Linked List is a linked list where the tail (the last node) points to the head (first node). So there is no pointer that points to NULL. There are 2 types of Circular Linked Lists:

a. Circular Single Linked List

Use one pointer to store a lot of data using linked list method.

b. Circular Double Linked List

It is similar with a circular single linked list, but the total pointer in each node here are two pointers.