Implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this. Use C++! The “data.txt” file has three lines of data 100, 110, 120, 130, 140, 150, 160 100, 130, 160 1@0, 2@3, 3@END You need to create an empty unsorted list add the numbers from the first line to list using putItem() function. Then print all the current keys to command line in one line using printAll(). delete the numbers given by the second line in the list by using deleteItem() function. Then print all the current keys to command line in one line using printAll().. putItem () the numbers in the third line of the data file to the corresponding location in The list. For example, 1@0 means adding number 1 at position 0 of the list. Then print all the current keys to command line in one line using printAll().. Implement the following functions by yourself and use them putItem(parameter one is the object to be added): append the object at the end of the list. putItem(parameter one is the object to be added, parameter two is the position starting From 0): insert the item at the position. deleteItem(parameter is the key which is an integer): remove the item getItem(parameter is an index value which starts from 0) returns the item object reference printAll(parameter is the pointer that points to the beginning of the list), print all keys in Order in the list. PLEASE make sure the test data file matches exactly how it is displayed up there so I can also run it with the same type of data file! Please show output, and please post solution WITHOUT linked list class! Example output is added in image.
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).
Implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this. Use C++!
The “data.txt” file has three lines of data
100, 110, 120, 130, 140, 150, 160
100, 130, 160
1@0, 2@3, 3@END
You need to
- create an empty unsorted list
- add the numbers from the first line to list using putItem() function.
- Then print all the current keys to command line in one line using printAll().
- delete the numbers given by the second line in the list by using deleteItem() function.
- Then print all the current keys to command line in one line using printAll()..
- putItem () the numbers in the third line of the data file to the corresponding location in The list. For example, 1@0 means adding number 1 at position 0 of the list.
Then print all the current keys to command line in one line using printAll()..
Implement the following functions by yourself and use them
- putItem(parameter one is the object to be added): append the object at the end of the list.
- putItem(parameter one is the object to be added, parameter two is the position starting From 0): insert the item at the position.
- deleteItem(parameter is the key which is an integer): remove the item
- getItem(parameter is an index value which starts from 0) returns the item object reference
- printAll(parameter is the pointer that points to the beginning of the list), print all keys in Order in the list.
PLEASE make sure the test data file matches exactly how it is displayed up there so I can also run it with the same type of data file! Please show output, and please post solution WITHOUT linked list class! Example output is added in image.
In this question we have to write a C++ program for the linked list which need to be implemented from the basic structure and we will implement the code form the above description
Let's code, hope this helps I tried with all implementations if you still find some queries you may utilize the threaded question.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
