How to make a simple program of traversing of linked list and doublly linked list in c++?

Question

0.00/5 (No votes)

See more:

C++

Program for linked list and circular linked list.

Posted 7-Feb-14 4:04am

Member 10579240

Add a Solution

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CPallini · Answer 1 · 2014-02-07T04:54:00

Solution 1

Coding, of course. If you need some background on linked list, a starting point could be the Wikipedia page[^].
A good read is the oldie-goldie Wirth's book: "Algorithms + Data Structures = Programs"[^].

Posted 7-Feb-14 4:54am

CPallini

BillW33 · Answer 2 · 2014-02-07T05:02:00

Read this tutorial[^] on a singly linked list then read this tutorial[^] on a doubly linked list.

If you need more remember that Google is your friend, you can use it to find many tutorials on the internet.
After you have read those articles write some of your own code. If you have a problem, post the code where you are having the problem AND clearly state the problem including any error messages. We will then be glad to help you solve your problem.