Please written by computer source Using C++, use a linked list to create an alphabetical Contact Book to store the names, addresses, and phone numbers of our contacts. The data structure used contain contacts should be a linked list and each time a new contact is added the contact will be inserted into the correct alphabetical location by last name. Assume there are no contacts that have the same last name. There will be two classes. One named LinkedList and the other named PersonNode. The LinkedList class will be used to create a single LinkedList object. - The class will have two PersonNode pointer fields *headPtr that will maintain the head of the linked list *tailPtr that will maintain the tail of the linked list - The class will have the following functions:: *a constructor that initialized the headPtr and tailPtr to NULL *addLink that will take a PersonNode reference or pointer and add the node to the linked list *findInsertSpot that will return a PersonNode pointer that points to the location where a PersonNode is to be inserted into the linked list *getHeadPtr that will return the headPtr
Please written by computer source
Using C++, use a linked list to create an alphabetical Contact Book to store the names, addresses, and phone numbers of our contacts. The data structure used contain contacts should be a linked list and each time a new contact is added the contact will be inserted into the correct alphabetical location by last name. Assume there are no contacts that have the same last name. There will be two classes. One named LinkedList and the other named PersonNode.
The LinkedList class will be used to create a single LinkedList object.
- The class will have two PersonNode pointer fields
*headPtr that will maintain the head of the linked list
*tailPtr that will maintain the tail of the linked list
- The class will have the following functions::
*a constructor that initialized the headPtr and tailPtr to NULL
*addLink that will take a PersonNode reference or pointer and add the node to the linked list
*findInsertSpot that will return a PersonNode pointer that points to the location where a PersonNode is to be inserted into the linked list
*getHeadPtr that will return the headPtr
The PersonNode class will be used to create the nodes that are part of the linked list
- The class will have the following fields:
*fName - string contains the contacts first name
*lName - string contains the contact last name
*address - string contains the contacts address
*phone - string contains the contacts phone number
*next - PersonNode pointer that points to the next contact
- The class will contain all of the getters and setters for the above named fields (see class diagram below) in addition to
*getFullName - returns the string of lName, fName
*a constructor that takes no arguments and sets next to NULL
*a constructor that takes arguments to set fName, lName, address, and phone and sets next to NULL
- Finally, create the ability to search for a PersonNode entry from the Contact Book and remove a PersonNode entry from the Contact Book.
- Please include all .cpp, .h, and the main Source.cpp file with main.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
