Skip to content
Related Articles
Open in App
Not now

Related Articles

Memory efficient doubly linked list

Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 05 Jul, 2017
Improve Article
Save Article

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

Solve DSA problems on GfG Practice.

Solve Problems
My Personal Notes arrow_drop_up
Related Articles
1. XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
2. XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
3. Why Linked List is implemented on Heap memory rather than Stack memory?
4. Difference between Singly linked list and Doubly linked list
5. Sort the given Matrix | Memory Efficient Approach
6. Construct a Doubly linked linked list from 2D Matrix
7. Reverse a singly Linked List in groups of given size | Set 4 (Space efficient approach)
8. Convert a Binary Tree into Doubly Linked List in spiral fashion
9. Create a Doubly Linked List from a Ternary Tree
10. Check if a doubly linked list of characters is palindrome or not
Previous
Generic Linked List in C
Next
XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty : Medium
Article Tags :
Practice Tags :
Report Issue
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox

Start Your Coding Journey Now!