# Memory efficient doubly linked list

Asked by Varun Bhatia.

**Question:**

Write a code for implementation of doubly linked list with use of single pointer in each node.

Solution:

This question is solved and very well explained at http://www.linuxjournal.com/article/6828.

We also recommend to read http://en.wikipedia.org/wiki/XOR_linked_list

## Recommended Posts:

- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- Difference between Singly linked list and Doubly linked list
- Reverse a Doubly Linked List | Set-2
- QuickSort on Doubly Linked List
- Reverse a Doubly Linked List
- Reverse a doubly circular linked list
- Doubly Linked List | Set 1 (Introduction and Insertion)
- Insertion Sort for Doubly Linked List
- Find pairs with given sum in doubly linked list
- Reverse a Doubly linked list using recursion
- Bubble Sort On Doubly Linked List
- Delete all the even nodes from a Doubly Linked List
- Merge Sort for Doubly Linked List
- Doubly Circular Linked List | Set 2 (Deletion)