A C Program related to doubly linked list

Question

1.00/5 (1 vote)

See more:

4. The next problem addresses adding a new element to a doubly-linked list.
Remember that
i) the elements of the list are to kept in ascending numerical order.
ii) your answers must address issues of a) adding to an empty list, b) adding at the start of the list, c) adding to the end of the list, as well as d) adding somewhere in the middle of an existing list.

Posted 23-Feb-12 18:30pm

jack545

Add a Solution

1 solution

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)

jack545 · Answer 1 · 2012-02-23T18:30:00

/* Adding to an empty chain*/
doubleChainCell* addInOrder(doubleChainCell *header, int data) {
doubleChainCell *addee = new(NULL, data, NULL);
if (header == NULL) {
header = addee;
return header;
}

/* Adding at the start of the chain */
if (data < header->data) {
addee->next = header;
header = addee;
return header;
}

/* Adding at the end of the chain */
doubleChainCell *pt = header, *previous = NULL;
while ((pt != NULL) && (data > pt->data)) {
previous = pt;
pt = pt->next;
}
previous->next = addee;
addee->previous = previous;
addee->next = pt;
if (pt != NULL) {

pt->previous = addee;
}
return header;
}