# 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

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.

## Recommended Posts:

- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- Difference between Singly linked list and Doubly linked list
- Construct a Doubly linked linked list from 2D Matrix
- Doubly Linked List Tutorial
- QuickSort on Doubly Linked List
- Reverse a Doubly Linked List
- Reverse a Doubly Linked List | Set-2
- Insertion Sort for Doubly Linked List
- Python | Queue using Doubly Linked List
- Reverse a doubly circular linked list
- Merge Sort for Doubly Linked List
- Priority Queue using doubly linked list
- Rotate Doubly linked list by N nodes
- Doubly Linked List | Set 1 (Introduction and Insertion)
- Doubly Circular Linked List | Set 2 (Deletion)
- Python | Stack using Doubly Linked List
- Implementation of Deque using doubly linked list
- Sort a k sorted doubly linked list
- Delete all occurrences of a given key in a doubly linked list