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


  1. i really got good help from it.
    Any person accessing this web site must atleast read the program

  2. i am in love with the help i got from this program. because it is understood

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: