How do you implement a doubly linked list by using singly linked list?
-
-
Answer:
Add another pointer to the nodes for the previous node: struct node { struct node *next; struct node *previous; void *data; }; typedef struct node node; Then change the logic for insertion and removal to make sure you set the previous pointer as well as the next one.
wiki.answers.com Visit the source
Related Q & A:
- how to draw circular doubly linked list?Best solution by TeX - LaTeX
- How can I implement a multilayer social network in R?Best solution by Computational Science
- How to programatically select a item in list using c#?Best solution by Software Quality Assurance & Testing
- How do I forward an e-mail to someone using my contact list?Best solution by Yahoo! Answers
- How do I import a yahoo email list into my yahoo group?Best solution by Yahoo! Answers
Just Added Q & A:
- How many active mobile subscribers are there in China?Best solution by Quora
- How to find the right vacation?Best solution by bookit.com
- How To Make Your Own Primer?Best solution by thekrazycouponlady.com
- How do you get the domain & range?Best solution by ChaCha
- How do you open pop up blockers?Best solution by Yahoo! Answers
For every problem there is a solution! Proved by Solucija.
-
Got an issue and looking for advice?
-
Ask Solucija to search every corner of the Web for help.
-
Get workable solutions and helpful tips in a moment.
Just ask Solucija about an issue you face and immediately get a list of ready solutions, answers and tips from other Internet users. We always provide the most suitable and complete answer to your question at the top, along with a few good alternatives below.