Member Insertion by Position 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 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 link list method to insert elements into the link list called “void LinkedList::insert(double x, int pos)” is called that insert elements into the link list at specific positions. A method to search for an element present in the link list called “ int LinkedList::search(double x)” is called that returns the position of the element present in the link list. 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)”. Declare a method “void reverse( )” to reverse the elements present in the link list by traversing through the list and Move node at end to the beginning of the new reverse list being constructed. 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. “int LinkedList::search(double x)” function is called to search the element present in the link list and prints the position of the element.

Question

Want to see the full answer?

Answer 1

Question

Chapter 17, Problem 8PC

Program Plan Intro

Member Insertion by Position

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 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 link list method to insert elements into the link list called “void LinkedList::insert(double x, int pos)” is called that insert elements into the link list at specific positions.

A method to search for an element present in the link list called “ int LinkedList::search(double x)” is called that returns the position of the element present in the link list.

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)”.

Declare a method “void reverse( )” to reverse the elements present in the link list by traversing through the list and Move node at end to the beginning of the new reverse list being constructed.

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.

“int LinkedList::search(double x)” function is called to search the element present in the link list and prints the position of the element.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Scores Class Write a class named Scores which should have the following attribute: • _scores (a list to hold test scores, 0 - 100. Initially empty. ) The Scores class should have an _init__ method that creates the _scores attribute. It should also have the following methods: • add_score: this method adds a score to the __scores list. It accepts a single score as it's' only argument. • get_average: this method accepts no arguments. If _scores is empty, this method returns -1. Otherwise, it returns the average of all scores in _scores. • get_high_score: this method accepts no arguments. if scores is empty, this method returns -1. Otherwise, it returns the highest score in __scores. • get_low_score: this method accepts no arguments. if scores is empty, this method returns -1. Otherwise, it returns the lowest score in scores. • _str_: This method returns a string similar to the following (assuming the _scores contains 89, 77, 93): Once you have written the class, write a program that…

C++ function Linked list Write a function, to be included in an unsorted linked list class, called replaceItem, that will receive two parameters, one called olditem, the other called new item. The function will replace all occurrences of old item with new item (if old item exists !!) and it will return the number of replacements done.

Basic java