[login to view URL]
Demonstrate creativity and problem-solving skills.
Write C++ programs that use proper style and documentation.
Write C++ programs that uses a Stack and Linked List.
Create a structure called AddressNode
The structure should contain a string for name and a pointer called AddressNode that points to “next” (the next element in the list).
Create classed called ABook.
Create the Default Constructure. (public)
Create the Deconstructor. (public)
AddressNode* topPtr. (private) – Should be a pointer to the top of the list.
ABook Methods (each of these methods must be created in your program)
ABook::ABook() – Default Constructor
ABook::Insert(string NewItem) – Add item to the Linked List
ABook::SortedInsert(string NewItem) – Add item to the Linked List (sorted)
ABook::Remove(string& item) – Remove element from the top of the stack and return the item.
ABook::~ABook() – Deconstructor. Removes all elements from the list.
Main Method
Declare new List (Hint: ABook Book;)
Declare new string newName.
Declare new string nameToRemove.
Call [login to view URL](“Precious”); - Insert Precious into list.
Call [login to view URL](“Ken”); - Insert Ken into listed (sorted)
Call [login to view URL](“Eileen”); - Insert Eileen into list (sorted)
Call [login to view URL](“Frank”); - Insert Frank into list (sorted)
Use [login to view URL] to remove each name one at a time and display to screen.
Include: system("PAUSE"); after your output to pause the screen.
Example output of your program
Sorted List:
Eileen
Frank
Ken
Precious
Hi, I have delivered world class products in my experience as a Software Engineer. I am good at designing systems and am abreast of good coding practices. I am sure of completing your job on time exceeding your quality expectations. Awaiting your reply. Have a great day!!!
Hi,I can definitely finish this project within an hour. The list u specified in the top is Single linked list. Once i finish the job i will get the money. That's why i haven't put any milestone. I am new to this site but not in skills.