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 2
- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- Difference between Singly linked list and Doubly linked list
- QuickSort on Doubly Linked List
- Reverse a Doubly Linked List | Set-2
- Reverse a Doubly Linked List
- Rotate Doubly linked list by N nodes
- Bubble Sort On Doubly Linked List
- Implementation of Deque using doubly linked list
- Priority Queue using doubly linked list
- Reverse a doubly circular linked list
- Python | Stack using Doubly Linked List
- Python | Queue using Doubly Linked List
- Delete all the even nodes from a Doubly Linked List
- Sort the biotonic doubly linked list
