In C:
Write a program that creates a double chained list that contains a word in information field. Interacting with the program will be made through the following average (required):

1. insertion in front of a given word;
2. Insert after a given word;
3. Insert the end;
4. delete a given word;
5. scrolling from the beginning;
6. scrolling to the end;
7. stop the program.
Please help

Question

In C: 
Write a program that creates a double chained list that contains a word in information field. Interacting with the program will be made through the following average (required):

1. insertion in front of a given word;
2. Insert after a given word;
3. Insert the end;
4. delete a given word;
5. scrolling from the beginning;
6. scrolling to the end;
7. stop the program.
Please help

elizabet · Answer

Note: If the word after that or before which the insertion must be done is not found, then the new element is added to end of the list

rvc · Answer

@rsmith6559

mathmate · Answer

The best way to learn and practise data-structures is to review an example, understand why and how things are done in the example, and try to reproduce the answer without looking at the example. Here's a good one for you to get started, with explanations. http://www.tutorialspoint.com/data_structures_algorithms/doubly_linked_list_algorithm.htm

mathmate · Answer

By the way, "computer science" is a more suitable place to post this question.