[Home]  [Edit this page]  [Recent Changes]  [Special Pages]  [Help] 

---

CircularDoublyLinkedList

---

(Computer Science) Circular doubly linked list

A Circular Doubly Linked List gives you the abillity to travel from the front to the end of the list in one jump as well as from the end to the front. The implementation is the same as a doubly linked list except you make the previous pointer of the first node point to the last node in the list and you make the next pointer of the last node point to the first node in the list.
[Edit this page]  [Page history]  [What links here]  [Discuss this topic]  [Printer Friendly]