# algorithm for the implementation of a circular doubly linked list in

Page 1 of 1

## 1 Replies - 22967 Views - Last Post: 22 February 2011 - 11:34 PMRate Topic: //<![CDATA[ rating = new ipb.rating( 'topic_rate_', { url: 'http://www.dreamincode.net/forums/index.php?app=forums&module=ajax&section=topics&do=rateTopic&t=218070&amp;s=7a18c2a030acce73f3951ca7b94f7610&md5check=' + ipb.vars['secure_hash'], cur_rating: 0, rated: 0, allow_rate: 0, multi_rate: 1, show_rate_text: true } ); //]]>

### #1 reva_reva

Reputation: 0
• Posts: 1
• Joined: 22-February 11

# algorithm for the implementation of a circular doubly linked list in

Posted 22 February 2011 - 10:20 PM

I know the algorithem for the circular singly linked list but have no idea for the circular doubly linked list.It would be kind if you could guide me.
i want to know correct algorithem for the implementation of a circular doubly linked list in "c"  Write an algorithm for Creating Circular Doubly Linked List in dfs.doc (20K)
thank you  Write an algorithm for Creating Circular Doubly Linked List in dfs.doc (20K)

Is This A Good Question/Topic? 0

## Replies To: algorithm for the implementation of a circular doubly linked list in

### #2 Salem_c

• void main'ers are DOOMED

Reputation: 2131
• Posts: 4,196
• Joined: 30-May 10

## Re: algorithm for the implementation of a circular doubly linked list in

Posted 22 February 2011 - 11:34 PM

There's nothing mysterious.

Going forwards, next->next->next... will eventually bring you back to the start, going one way round the list.

All you need to add is
Going backwards, prev->prev->prev... will eventually bring you back to the start, going the other way round the list.