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

This is a question that I have and would like someone who has experiences with scene graphs and entity component systems to answer.For context, I am currently implementing a game engine and currently I am debating on our current design.Our current design is we have a singular game component class that every component inherits from. Where we have components like SpriteRendererComponent, Mehs Component, etc. They inherit from this GameComponent class. The point of this is being able to have O(1) access to the scene to being able to modify components to attach more components with the idea of accessing those components to specific scene objects in a scene.Now, my question is what kinds of caveauts can this cause in terms of cache coherence? I am well aware that yes its O(1) and that is great but cache coherence is going to be really bad, but would like to know more explicit details and real-life examples such as write in RAM examples on how this is bad. A follow-up question that is part…

Q4: Consider the following MAILORDER relational schema describing the data for a mail order company. (Choose five only). PARTS(Pno, Pname, Qoh, Price, Olevel) CUSTOMERS(Cno, Cname, Street, Zip, Phone) EMPLOYEES(Eno, Ename, Zip, Hdate) ZIP CODES(Zip, City) ORDERS(Ono, Cno, Eno, Received, Shipped) ODETAILS(Ono, Pno, Qty) (10 Marks) I want a detailed explanation to understand the mechanism how it is Qoh stands for quantity on hand: the other attribute names are self-explanatory. Specify and execute the following queries using the RA interpreter on the MAILORDER database schema. a. Retrieve the names of parts that cost less than $20.00. b. Retrieve the names and cities of employees who have taken orders for parts costing more than $50.00. c. Retrieve the pairs of customer number values of customers who live in the same ZIP Code. d. Retrieve the names of customers who have ordered parts from employees living in Wichita. e. Retrieve the names of customers who have ordered parts costing less…

Q4: Consider the following MAILORDER relational schema describing the data for a mail order company. (Choose five only). (10 Marks) PARTS(Pno, Pname, Qoh, Price, Olevel) CUSTOMERS(Cno, Cname, Street, Zip, Phone) EMPLOYEES(Eno, Ename, Zip, Hdate) ZIP CODES(Zip, City) ORDERS(Ono, Cno, Eno, Received, Shipped) ODETAILS(Ono, Pno, Qty) Qoh stands for quantity on hand: the other attribute names are self-explanatory. Specify and execute the following queries using the RA interpreter on the MAILORDER database schema. a. Retrieve the names of parts that cost less than $20.00. b. Retrieve the names and cities of employees who have taken orders for parts costing more than $50.00. c. Retrieve the pairs of customer number values of customers who live in the same ZIP Code. d. Retrieve the names of customers who have ordered parts from employees living in Wichita. e. Retrieve the names of customers who have ordered parts costing less than$20.00. f. Retrieve the names of customers who have not placed…