Tree Copy Constructor Program Plan: Define a class BTreeNode to create nodes for binary search tree items. Include all the required header files. Initialize a value to the node, and set the left child of node to leftp and right child of node to rightp. Define a class to create a Binary Search Tree. Create a copy constructor BST::BST(BST &t)that copies all the items present in the binary search tree. Create a destructor BST & BST::operator=(BST &t)for assignment operator. Create a function void BST::destroyTree that deallocates all storage for nodes of a tree using the destructor. Create a function int width that returns width of the tree. Create a function bool search to search a particular item in tree. Create a function leafCounter that counts no. of leaves present in a level. Create function void insert to insert nodes into the tree. Create a function void inorder to sort items in inorder traversal. Declare the main function. Prompt the user to enter 5 numbers to be inserted into tree. Sort the items present in the tree in inorder traversal and print the items. Copy all the items of the tree elements. Prompt the user to enter a new value to be entered into tree. Print the items present in new tree in order traversal. Print the items present in original tree using copy constructor. Print the items present in the new tree by reassigning the values of the old tree.

Question

Want to see the full answer?

Answer 1

Question

Chapter 19, Problem 7PC

Program Plan Intro

Tree Copy Constructor

Program Plan:

Define a class BTreeNode to create nodes for binary search tree items.

Include all the required header files.

Initialize a value to the node, and set the left child of node to leftp and right child of node to rightp.

Define a class to create a Binary Search Tree.

Create a copy constructor BST::BST(BST &t)that copies all the items present in the binary search tree.

Create a destructor BST & BST::operator=(BST &t)for assignment operator.

Create a function void BST::destroyTree that deallocates all storage for nodes of a tree using the destructor.

Create a function int width that returns width of the tree.

Create a function bool search to search a particular item in tree.

Create a function leafCounter that counts no. of leaves present in a level.

Create function void insert to insert nodes into the tree.

Create a function void inorder to sort items in inorder traversal.

Declare the main function.

Prompt the user to enter 5 numbers to be inserted into tree.

Sort the items present in the tree in inorder traversal and print the items.

Copy all the items of the tree elements.

Prompt the user to enter a new value to be entered into tree.

Print the items present in new tree in order traversal.

Print the items present in original tree using copy constructor.

Print the items present in the new tree by reassigning the values of the old tree.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Considering the TM example of binary sum ( see attached)do the step-by-step of execution for the binary numbers 1101 and 11. Feel free to use the Formal Language Editor Tool to execute it; Write it down the current state of the tape (including the head position) and indicate the current state of the TM at each step.

I need help on inculding additonal code where I can can do the opposite code of MatLab, where the function of t that I enter becomes the result of F(t), in other words, turning the time-domain f(t) into the frequency-domain function F(s):

I need help with the TM computation step-by-step execution for the binary numbers 1101 and 11. Formal Language Editor Tool can be used to execute it; Write it down the current state of the tape (including the head position) and indicate the current state of the TM at each step;