Circular
Linked List
Circular linked Lists is used to traverse the same list again. A circular list is very similar to the
linear list where in the circular list the pointer
of the last node points not NULL but the first node.
see the diagram
1. Linked list
Circular linked Lists is used to traverse the same list again. A circular list is very similar to the
linear list where in the circular list the pointer
of the last node points not NULL but the first node.
see the diagram
Circular Linked List (CLL)
1.
Circular Linked List is devided into two parts:
(a) Singly circular Linked List
(b) Doubly Circular Linked List
2.
In CLL address field of last node contains address
of “first node”
3.
First node and last nodes are adjacent
4.
Linked list is made circular by linking first
and last node
5.
In CLL we can access in two ways only if we are using
Doubly Circular Linked List
We can not access randomly because in Linked
List we can access only in sequentially.1. Linked list
No comments:
Post a Comment