Chapter 17, Problem 5PC

Program Plan Intro

List Member Deletion

Program Plan:

• Include the required specifications into the program.
• Declare a class ListNode.
  • Declare the member variables “value” and “*p” in structure named “ListNode”.
  • The data value of node is stored in variable v and address to next pointer is stored in pointer p
  • Declare the constructor, destructor, and member functions in the class.
  • Declare the structure variable “next” and a friend class Linked List
• Declare a class LinkList.
  • Function to insert elements into the linked list “void add(double n)”is defined.
  • Function to check whether a particular node with a data value n is a part of linked list or not “bool isMember(double n)”.
  • A recursive print method is defined to print all the data values present in the link list “void rPrint()”.
  • A destructor is called to delete the desired data value entered by the user called   “LinkedList::~LinkedList( )”.
  • A method to remove the element passed as a parameter from the link list is called “void LinkedList::remove(double x)”.
  • Declaration of structure variable head to store the first node of the list “ListNode * head” is defined.
  • A function “void LinkedList::add(double n)” is defined which adds or inserts new nodes into the link list.
  • A function “bool LinkedList::isMember(double n)” is defined which  searches for a given data value within the nodes present in the link list.
  • A destructor “LinkedList::~LinkedList()” deallocates the memory for the link list.
  • A function “void LinkedList::print()” is used to print all the node data values present in the link list by traversing through each nodes in the link list.
  • A recursive member function check is defined called “bool LinkedList::rIsMember(ListNode *pList,double x)” .
    • If the data value entered is present within the link list, it returns true, else it returns false.
• Declare the main class.
  • Create an empty list to enter the data values into the list.
  • Copy is done using copy constructor.
  • Input “5” numbers from user and insert the data values into the link list calling “void LinkedList::add(double n)” function.
  • Print the data values of the nodes present in the link list.
  • Ask the user to enter an element to be removed.
    • A loop is executed to traverse through the list and find the value entered.
    • If the element is found, thelist1.remove (number) is called and the element is removed.
    • The remaining list elements are printed.