Difference- Singly and Doubly Linked Circullar List [CS62 june 2001]
Queastion: 2(b) List the difference between a Singly Linked Circular List and Doubly Linked Circular List. List the advantages of each list.
Answer: In single linked circular list one cannot traverse a list backward, nor can a node be deleted from a circularly linked list, given only a pointer to that node. Whereas in double linked list each node in such a list contains two pointers, one to its predecessores and another its successor. Deleting a given node is possible in double linked list whereas it is not possible in simple linked lists.
Answer: In single linked circular list one cannot traverse a list backward, nor can a node be deleted from a circularly linked list, given only a pointer to that node. Whereas in double linked list each node in such a list contains two pointers, one to its predecessores and another its successor. Deleting a given node is possible in double linked list whereas it is not possible in simple linked lists.
