Recursive Member Check 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 destructor to check whether the data value entered is a member function or not is defined “bool isMember(double x){ return rIsMember(head, x);}~LinkedList()”. 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. Check whether the data value entered is a member of the link list or not by calling “list1.isMember(x)” function. If the data value entered is present within the link list, it prints member, else it prints not member.

Question

Want to see the full answer?

Answer 1

Question

Chapter 17, Problem 4PC

Program Plan Intro

Recursive Member Check

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 destructor to check whether the data value entered is a member function or not is defined “bool isMember(double x){ return rIsMember(head, x);}~LinkedList()”.

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.

Check whether the data value entered is a member of the link list or not by calling “list1.isMember(x)” function.

If the data value entered is present within the link list, it prints member, else it prints not member.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Pllleasassseee ssiiirrrr soolveee thissssss questionnnnnnn

Answer 2

Question

Chapter 17, Problem 4PC

Program Plan Intro

Recursive Member Check

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 destructor to check whether the data value entered is a member function or not is defined “bool isMember(double x){ return rIsMember(head, x);}~LinkedList()”.

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.

Check whether the data value entered is a member of the link list or not by calling “list1.isMember(x)” function.

If the data value entered is present within the link list, it prints member, else it prints not member.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 3

Question

Chapter 17, Problem 4PC

Program Plan Intro

Recursive Member Check

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 destructor to check whether the data value entered is a member function or not is defined “bool isMember(double x){ return rIsMember(head, x);}~LinkedList()”.

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.

Check whether the data value entered is a member of the link list or not by calling “list1.isMember(x)” function.

If the data value entered is present within the link list, it prints member, else it prints not member.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 4

Question

Chapter 17, Problem 4PC

Program Plan Intro

Recursive Member Check

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 destructor to check whether the data value entered is a member function or not is defined “bool isMember(double x){ return rIsMember(head, x);}~LinkedList()”.

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.

Check whether the data value entered is a member of the link list or not by calling “list1.isMember(x)” function.

If the data value entered is present within the link list, it prints member, else it prints not member.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 5

Chapter 17, Problem 4PC

Program Plan Intro

Recursive Member Check

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 destructor to check whether the data value entered is a member function or not is defined “bool isMember(double x){ return rIsMember(head, x);}~LinkedList()”.

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.

Check whether the data value entered is a member of the link list or not by calling “list1.isMember(x)” function.

If the data value entered is present within the link list, it prints member, else it prints not member.

Answer 6

Chapter 17, Problem 4PC

Program Plan Intro

Recursive Member Check

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 destructor to check whether the data value entered is a member function or not is defined “bool isMember(double x){ return rIsMember(head, x);}~LinkedList()”.

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.

Check whether the data value entered is a member of the link list or not by calling “list1.isMember(x)” function.

If the data value entered is present within the link list, it prints member, else it prints not member.

Answer 7

Chapter 17, Problem 4PC

Program Plan Intro

Recursive Member Check

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 destructor to check whether the data value entered is a member function or not is defined “bool isMember(double x){ return rIsMember(head, x);}~LinkedList()”.

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.

Check whether the data value entered is a member of the link list or not by calling “list1.isMember(x)” function.

If the data value entered is present within the link list, it prints member, else it prints not member.

Answer 8

Expert Solution & Answer

Answer 9

Expert Solution & Answer

Answer 10

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 11

Ch. 17.1 - Prob. 17.1CP Ch. 17.1 - Prob. 17.2CP Ch. 17.1 - Prob. 17.3CP Ch. 17.1 - Prob. 17.4CP Ch. 17.2 - Prob. 17.5CP Ch. 17.2 - Prob. 17.6CP Ch. 17.2 - Why does the insertNode function shown in this...Ch. 17.2 - Prob. 17.8CP Ch. 17.2 - Prob. 17.9CP Ch. 17.2 - Prob. 17.10CP

Solution Summary: The author describes the requirements of the Recursive Member Check program.

Concept explainers

Want to see the full answer?

Chapter 17 Solutions