1. Create a program that uses a LINKED LIST to do the following: a. Using the attached file, input.txt, read the integers and dynamically process a linked list. The file contains action code and integer pairs. Process these actions as they are read. The action code is first: I = Insert a new node with the corresponding value. Insert in ascending(sorted) order D = Delete the node with the corresponding value S = Search the current list for the corresponding value b. You may use any examples reviewed in class that explain how to process a linked list. The book contains examples and code to insert into, delete from and search a linked list c. If the action is 'S' and the value does NOT exist in the linked list, display an appropriate message. If the value DOES exist in the linked list, display an appropriate message. d. If the action is 'D' and the value does NOT exist in the linked list, display an appropriate message e. After all input is processed, display the contents of the resulting linked list f. Read until end of file. DO NOT code the loop for the number of values in the table g. Do not use the linked list ADT in the book (although you may use the code in the ADT methods as examples. Design and implement the solution however you wish(all in main, functions, etc.) Input.txt file I 10 I 20 I 15 I 35 D 10 S 20 D 19 I 22 I 25 D 15 S 99 I 34 I 45 I 20
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
1. Create a program that uses a LINKED LIST to do the following:
a. Using the attached file, input.txt, read the integers and dynamically process a linked list.
The file contains action code and integer pairs. Process these actions as they are read.
The action code is first:
I = Insert a new node with the corresponding value. Insert in ascending(sorted) order
D = Delete the node with the corresponding value
S = Search the current list for the corresponding value
b. You may use any examples reviewed in class that explain how to process a linked list.
The book contains examples and code to insert into, delete from and search a linked list
c. If the action is 'S' and the value does NOT exist in the linked list, display an appropriate message.
If the value DOES exist in the linked list, display an appropriate message.
d. If the action is 'D' and the value does NOT exist in the linked list, display an appropriate message
e. After all input is processed, display the contents of the resulting linked list
f. Read until end of file. DO NOT code the loop for the number of values in the table
g. Do not use the linked list ADT in the book (although you may use the code in the ADT methods as examples. Design and implement the solution however you wish(all in main, functions, etc.)
Input.txt file
I 10 I 20 I 15 I 35 D 10 S 20 D 19 I 22 I 25 D 15 S 99 I 34 I 45 I 20
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
