Question

Difference between circular linked list and doubly linked list​

Answer 1

1. The circular linked list have only a single pointer i.e. pointer to the next node. While in case of doubly linked list it has 2 pointer i.e. pointer to forward node and pointer to next node.
2. In circular linked list last node will point to first node while in doubly linked list last node will point to previous as well as null