Lesson 30 of 50
cDynamic Data Structures – Doubly Linked List
15 mins
Course progress60%
What you'll learn
Keep these ideas in mind as you work through the lesson.
Lesson 30 of 50
c15 mins
Keep these ideas in mind as you work through the lesson.
A doubly linked list stores two pointers per node – next and prev. This allows O(1) deletion and reverse traversal.
struct DNode {
int data;
struct DNode *prev;
struct DNode *next;
};
Key operations:
Memory overhead is higher (extra pointer) but many algorithms need bi‑directional access (e.g., LRU cache).