Develop a linked-list processing function, IsolateTargetSoloAsTail, to process a linked list as follows. ● If a target cannot be found on the given list, a new node containing the target is created and added to the list's end (made the new tail node). ► This includes the case where the given list is empty, in which the new tail node added is also the new head node. (This is so because the only node in a 1-node list is the list's head and tail node.) ● If the target appears only once on the given list, the target-matching node is moved to the list's end (made the new tail node). ► Nothing needs to be done if the target-matching node is already the tail node (of the given list). ● If the target appears multiple times on the given list, the first target-matching node is moved to the list's end (made the new tail node), and all other target-matching nodes are to be deleted from the list. ► Note that although the target-matching node to be moved does not have to be the first (i.e., it can also be any of the other target-matching nodes) for the function to work as intended, you are to make it so for the purpose (and simplicity/uniformity) of this exercise. Algorithm should: ○ NOT change the data of any existing nodes. ○ Destroy ONLY existing nodes that constitute the second target-matching node, third target-matching node, etc.
Develop a linked-list processing function, IsolateTargetSoloAsTail, to process a linked list as follows. ● If a target cannot be found on the given list, a new node containing the target is created and added to the list's end (made the new tail node). ► This includes the case where the given list is empty, in which the new tail node added is also the new head node. (This is so because the only node in a 1-node list is the list's head and tail node.) ● If the target appears only once on the given list, the target-matching node is moved to the list's end (made the new tail node). ► Nothing needs to be done if the target-matching node is already the tail node (of the given list). ● If the target appears multiple times on the given list, the first target-matching node is moved to the list's end (made the new tail node), and all other target-matching nodes are to be deleted from the list. ► Note that although the target-matching node to be moved does not have to be the first (i.e., it can also be any of the other target-matching nodes) for the function to work as intended, you are to make it so for the purpose (and simplicity/uniformity) of this exercise. Algorithm should: ○ NOT change the data of any existing nodes. ○ Destroy ONLY existing nodes that constitute the second target-matching node, third target-matching node, etc.
Chapter3: Data Representation
Section: Chapter Questions
Problem 1PE
Related questions
Concept explainers
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).
Question
Develop a linked-list processing function, IsolateTargetSoloAsTail, to process a linked list as follows.
| ● | If a target cannot be found on the given list, a new node containing the target is created and added to the list's end (made the new tail node). |
| ► | This includes the case where the given list is empty, in which the new tail node added is also the new head node. (This is so because the only node in a 1-node list is the list's head and tail node.) |
| ● | If the target appears only once on the given list, the target-matching node is moved to the list's end (made the new tail node). |
| ► | Nothing needs to be done if the target-matching node is already the tail node (of the given list). |
| ● | If the target appears multiple times on the given list, the first target-matching node is moved to the list's end (made the new tail node), and all other target-matching nodes are to be deleted from the list. |
| ► | Note that although the target-matching node to be moved does not have to be the first (i.e., it can also be any of the other target-matching nodes) for the function to work as intended, you are to make it so for the purpose (and simplicity/uniformity) of this exercise. |
| ○ | NOT change the data of any existing nodes. |
| ○ | Destroy ONLY existing nodes that constitute the second target-matching node, third target-matching node, etc. |
evelop a linked-list processing function IsolateTargetSoloAsTail that is to process a linked list as follows.
| ● | If target cannot be found on the given list, a new node containing target is created and added to the end (made the new tail node) of the list. |
| ► | This includes the case where the given list is empty, in which case the new tail node added is also new head node. (This is so because the only node in a 1-node list is both the head and tail node of the list.) |
| ● | If target appears only once on the given list, the target-matching node is moved to the end (made the new tail node) of the list. |
| ► | In case the target-matching node is already the tail node (of the given list), then nothing needs to be done. |
| ● | If target appears multiple times on the given list, the first target-matching node is moved to the end (made the new tail node) of the list, and all other target-matching nodes are to be deleted from the list. |
| ► | Note that although the target-matching node to be moved does not have to be the first (i.e., it can also be any of the other target-matching nodes) for the function to work as intended, you are to make it so for the purpose (and simplicity/uniformity) of this exercise. |
void IsolateTargetSoloAsTail(Node* headPtr, int target);
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning