Ø
Circular
doubly linked list –
·
A
circular linked list or a circular two way linked list is a more complex type
of linked list.
·
A
circular linked list contains a pointer to the next as well as previous node in
the sequence.
·
In a
circular linked list there is no NULL value in previous part of first node and
next part of last node.
·
In a
circular linked list last node point to the first node.
