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 “print()” 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. Using “if…else” to check whether the list is empty or not, if the list is empty display an appropriate message on the screen. Otherwise, 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. Make a call to the function “print” to display all the values in the list on the screen.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 2PC

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 “print()” 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.

Using “if…else” to check whether the list is empty or not, if the list is empty display an appropriate message on the screen.

Otherwise, 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.

Make a call to the function “print” to display all the values in the list on the screen.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

A cylinder of diameter 10 cm rotates concentrically inside another hollow cylinder of inner diameter 10.1 cm. Both cylinders are 20 cm long and stand with their axis vertical. The annular space is filled with oil. If a torque of 100 kg cm is required to rotate the inner cylinder at 100 rpm, determine the viscosity of oil. Ans. μ= 29.82poise

Make the following game user friendly with GUI, with some simple graphics The following code works as this: The objective of the player is to escape from this labyrinth. The player starts at the bottom left corner of the labyrinth. He has to get to the top right corner of the labyrinth as fast he can, avoiding a meeting with the evil dragon. The player can move only in four directions: left, right, up or down. There are several escape paths in all labyrinths. The player’s character should be able to moved with the well known WASD keyboard buttons. If the dragon gets to a neighboring field of the player, then the player dies. Because it is dark in the labyrinth, the player can see only the neighboring fields at a distance of 3 units. Cell Class: public class Cell { private boolean isWall; public Cell(boolean isWall) { this.isWall = isWall; } public boolean isWall() { return isWall; } public void setWall(boolean isWall) { this.isWall = isWall; } @Override public String toString() {…

Please original work What are four of the goals of information lifecycle management think they are most important to data warehousing, Why do you feel this way, how dashboards can be used in the process, and provide a real life example for each. Please cite in text references and add weblinks