TYPES OF LINKED LIST
=> Linear linked list-one way linked list is a linear collection of homogeneous data elements organised in sequence of nodes.Each node has two parts:-(a)Data part
(b)Link part
=> Doubly Linked list- Doubly linked list is bidirectional list. In two way linked list each node is divided into three parts.
(a) Previous pointer
(b) Data part
(c) Next part
=> Header Linked List- Header linked list is a linked list with a special header node which is placed at the beginning of linked list.
=> Circular list- In circular list last node of list points to first node of list. There is no null pointer in circular linked list.
No comments:
Post a Comment