Doubly Linked List : C Programming Data Structure

Doubly Linked List

1. In Doubly Linked List , each node contain two address fields .
2. One address field for storing address of next node to be followed and second address field contain address of previous node linked to it.
3. So Two way access is possible i.e We can start accessing nodes from start as well as from last .
4. Like Singly Linked List also only Linear but Bidirectional  Sequential  movement is possible.
5. Elements are accessed sequentially , no direct access is allowed.

---

Tags / Keywords : | Doubly Linked List

---