Archive for February, 2007|Monthly archive page

Circular Doubly Linked List With Out Using Special Head or Tail Node

In C Tidbits, Data Structures in C/C++ on February 28, 2007 at 5:24 pm

Circular double linked list can be traversed clockwise or anticlockwise. In this list all nodes are linked as shown in the below figure. The only difference between double linked list and circular double linked list is last node points to first node in the list, first node points to last node instead of pointing to NULLs.

please refer http://www.refcode.net/2013/02/double-linked-lists.html