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

Given the following struct that represents a binary tree: struct Node { int key: Node "parent; Node "left; Node "right; Nodelint k) : key(k), parent(nullptr), left(nullptr), right(nullptr) (I: 1: Write a recursive function that prints out the nodes in a tree stored using the above structure in order to cout. The function prints the depth (root depth is at 0) and key of that node separated by a colon (Example "O: 10\n" for root with key 10). Your function CAN NOT create any local variables and can only use what is passed to the function. Use the below function signature (NOTE: this is not a class method). void inorderAndDepth(Node "node, int depth)

Binary Search Tree Empirical and Theoretical ResultsPart 1: we need to define a binary search tree data structure. Also, we need to implement the following functions:1. Insert Sorted: BSTREE insert(BSTREE root, int num): root points to a node in a binary search tree; num is a number to be inserted in the tree rooted at “root”. This function returns the root of the modified tree.2. Print Elements: void inorder traversal(BSTREE root, FILE *fp): root points to a node in a binary search tree. This function does not return anything, but prints out, to the file specified, the nodes in the tree rooted at “root” by performing an inorder traversal. Part 2: Test the performance of the designed data structure using theoretical and experimental approaches as follows:1. Dataset 1-Dataset is sorted- Add code to insert the numbers 1...n in that order in an initially empty doubly linked list and a binary search tree.a. Run it on different values of n where :i. n = 20,000ii. n = 50,000iii. n =…

Programming language C++ problem