In C++, Write the implementation for the methods of the Node class including the constructor. The constructor should set value to the passed in parameter, and set the value of the next pointer to NULL. getNext() should return the value of the next pointer. setNext() should set the value of the next pointer to the parameter that is passed in. In the main() function below (where it says // Step 2 code here), write the code to make a list of 10 Node objects. To do this, make a root pointer which is a pointer to a Node object, and then use a loop to create new Nodes, hooking up the list using setNext() and getNext() for each node. Set the value of each new Node to be the even numbers 2 through 18 (in addition to the root node which has value 0). Make sure that your nodes are linked together! Write code to step through your linked list (where it says // Step 3 code here), printing the value of each node. Write code to clean up the list (where it says // Step 4 code here). Print a message in the destructor when a Node is deleted. int main() { Node *root; // This will be the unchanging first Node root = new Node(0); // root now points to a Node object // Step 2 code here // Step 3 code here // Step 4 code here return 0; }

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

In C++,

Write the implementation for the methods of the Node class including the constructor.
- The constructor should set value to the passed in parameter, and set the value of the next pointer to NULL.
- getNext() should return the value of the next pointer.
- setNext() should set the value of the next pointer to the parameter that is passed in.
In the main() function below (where it says // Step 2 code here), write the code to make a list of 10 Node objects. To do this, make a root pointer which is a pointer to a Node object, and then use a loop to create new Nodes, hooking up the list using setNext() and getNext() for each node. Set the value of each new Node to be the even numbers 2 through 18 (in addition to the root node which has value 0). Make sure that your nodes are linked together!
Write code to step through your linked list (where it says // Step 3 code here), printing the value of each node.
Write code to clean up the list (where it says // Step 4 code here). Print a message in the destructor when a Node is deleted.

int main()

{ Node *root; // This will be the unchanging first Node

root = new Node(0); // root now points to a Node object

// Step 2 code here

// Step 3 code here

// Step 4 code here

return 0;

}

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 5 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions