Chapter 17, Problem 1PC

Program Plan Intro

Simple Linked List Class

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)”.
  • 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.
• Declare the main class.
  • Create an empty list to enter the data values into the list.
  • Input “5” numbers from user and insert the data values into the link list calling “void LinkedList::add(double n)” function.
  • Check whether a data value is a member of the linked list or not by calling the “bool LinkedList::isMember(double n)” function.
  • Print whether the data value entered is present within the link list or not.