Linked List Operations Program Plan: “IntList.h”: Include the required specifications into the program. Define a class named “IntList”. Declare the member variables “value” and “*next” in structure named “ListNode”. Declare the constructor, destructor, and member functions in the class. “IntList.cpp”: Include the required header files into the program. Define a function named “appendNode()” to insert the node at end of the list. Declare the structure pointer variables “newNode” and “dataPtr” for the structure named “ListNode”. Assign the value “num” to the variable “newNode” and assign null to the variable “newNode”. Using “if…else” condition check whether the list is empty or not, if the “head” is empty then make a new node into “head” pointer. Otherwise, make a loop to find last node in the loop. Assign the value of “dataPtr” into the variable “newNode”. Define a function named “display()” to print the values in the list. Declare the structure pointer “dataPtr” for the structure named “ListNode”. Initialize the variable “dataPtr” with the “head” pointer. Make a loop “while” to display the values of the list. Define a function named “insertNode()” to insert a value into the list. Declare the structure pointer variables “newNode”, “dataPtr”, and “prev” for the structure named “ListNode”. Make a “newNode” value into the received variable value “num”. Use “if…else” condition to check whether the list is empty or not. If the list is empty then initialize “head” pointer with the value of “newNode” variable. Otherwise, make a “while” loop to test whether the “num” value is less than the list values or not. Use “if…else” condition to initialize the value into list. Define a function named “deleteNode()” to delete a value from the list. Declare the structure pointer variables “dataPtr”, and “prev” for the structure named “ListNode”. Use “if…else” condition to check whether the “head” value is equal to “num” or not. Initialize the variable “dataPtr” with the value of the variable “head”. Remove the value using “delete” operator and reassign the “head” value into the “dataPtr”. If the “num” value not equal to the “head” value, then define the “while” loop to assign the “dataPtr” into “prev”. Use “if” condition to delete the “prev” pointer. Define the destructor to destroy the list values from the memory. Declare the structure pointer variables “dataPtr”, and “nextNode” for the structure named “ListNode”. Initialize the variable “dataPtr” with the “head” pointer. Define a “while” loop to make the links of node into “nextNode” and remove the node using “delete” operator. “Main.cpp”: Include the required header files into the program. Declare an object named “obj” for the class “IntList”. Make a call to functions for insert, append, and delete operations.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 1PC

Program Plan Intro

Linked List Operations

Program Plan:

“IntList.h”:

Include the required specifications into the program.

Define a class named “IntList”.

Declare the member variables “value” and “*next” in structure named “ListNode”.

Declare the constructor, destructor, and member functions in the class.

“IntList.cpp”:

Include the required header files into the program.

Define a function named “appendNode()” to insert the node at end of the list.

Declare the structure pointer variables “newNode” and “dataPtr” for the structure named “ListNode”.

Assign the value “num” to the variable “newNode” and assign null to the variable “newNode”.

Using “if…else” condition check whether the list is empty or not, if the “head” is empty then make a new node into “head” pointer. Otherwise, make a loop to find last node in the loop.

Assign the value of “dataPtr” into the variable “newNode”.

Define a function named “display()” to print the values in the list.

Declare the structure pointer “dataPtr” for the structure named “ListNode”.

Initialize the variable “dataPtr” with the “head” pointer.

Make a loop “while” to display the values of the list.

Define a function named “insertNode()” to insert a value into the list.

Declare the structure pointer variables “newNode”, “dataPtr”, and “prev” for the structure named “ListNode”.

Make a “newNode” value into the received variable value “num”.

Use “if…else” condition to check whether the list is empty or not.

If the list is empty then initialize “head” pointer with the value of “newNode” variable.

Otherwise, make a “while” loop to test whether the “num” value is less than the list values or not.

Use “if…else” condition to initialize the value into list.

Define a function named “deleteNode()” to delete a value from the list.

Declare the structure pointer variables “dataPtr”, and “prev” for the structure named “ListNode”.

Use “if…else” condition to check whether the “head” value is equal to “num” or not.

Initialize the variable “dataPtr” with the value of the variable “head”.

Remove the value using “delete” operator and reassign the “head” value into the “dataPtr”.

If the “num” value not equal to the “head” value, then define the “while” loop to assign the “dataPtr” into “prev”.

Use “if” condition to delete the “prev” pointer.

Define the destructor to destroy the list values from the memory.

Declare the structure pointer variables “dataPtr”, and “nextNode” for the structure named “ListNode”.

Initialize the variable “dataPtr” with the “head” pointer.

Define a “while” loop to make the links of node into “nextNode” and remove the node using “delete” operator.

“Main.cpp”:

Include the required header files into the program.

Declare an object named “obj” for the class “IntList”.

Make a call to functions for insert, append, and delete operations.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Figure 1 Q.2/ Find the transfer function, G(s) = Vo(s)/Vi(s), for the network shown in Figure 2. ΙΩ 1 H 0000 + vi(t) + 19 (b) Figure 2 1F vo(t)

Attached is a text file called "Test.txt" that I've created for Python: "There was nothing so very remarkable in that; nor did Alice think it so very much out of the way to hear the Rabbit say to itself, “Oh dear! Oh dear! I shall be late!” (when she thought it over afterwards, it occurred to her that she ought to have wondered at this, but at the time it all seemed quite natural); but when the Rabbit actually took a watch out of its waistcoat-pocket, and looked at it, and then hurried on, Alice started to her feet, for it flashed across her mind that she had never before seen a rabbit with either a waistcoat-pocket, or a watch to take out of it, and burning with curiosity, she ran across the field after it, and fortunately was just in time to see it pop down a large rabbit-hole under the hedge." I'm trying to create a Markov chain with this code I have here (markov.py) but the program won't run because it doesn't have a direct path to "Test.txt". Can you help me fix this issue?…

dont use chatgbt to solve this question please and thank you.