Question
Hi I really need help with this program can someone help this is a c++ program. I posted this before but no one helped. In
Hi I really need help with this program can someone help this is a c++ program. I posted this before but no one helped. In this program, predefined linked-list libraries are not allowed. All linked-list functions are to be defined within your program. Thank you so much.
Implement a transaction-based linked list data structure using C++. The program will be interactive. Data transactions will be entered at the command line and results will be displayed on the console. A numerically organized linked list of names and ages will be created, updated and managed using Add, Delete and List transactions. These transaction types will be processed as follows:
Add To add a name to the list, enter a transaction in the form of A, space, name (no spaces in the name), space, age. For example: A John 28. If the new name is not on the list, the name and age will be added such that the list of names is in ascending numerical order by age (i.e., youngest first) and the message name added will be displayed. Case-Sensitive name comparison is used to see if the name is on the list. If the name is already on the list, the name will not be added, and the message name not added will be displayed.
Delete To delete a name and age from the list, enter a transaction in the form of D, space, name (no spaces in the name). For example D Joan. If the name is not on the list, the message name not found will be displayed. If the name is on the list, the name and age will be removed and the message name deleted will be displayed.
List To display the names in age sequence (i.e. youngest first), enter a transaction in the form L. Each name in the list will be displayed with the respective age on a line by itself. Within a particular age, the sequence of the names having the same age is not relevant.
Quit To terminate the program, enter a transaction in the form of Q.
Please help if you have read this I really need help thank you so much
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started