Height of the Binary Tree Program Plan: Create a template prefix and define the template class BinaryTree to perform the following functions: Declare the required variables. Declare the function prototypes. Define the no-argument generic constructor BinaryTree() to initialize the root value as null. Call the functions insertNode(), remove(), displayInOrder(), and treeHeight(). Define the generic function insert() to insert the node in position pointed by the tree node pointer in a tree. Define the generic function insertNode() to create a new node and it should be passed inside the insert() function to insert a new node into the tree. Define the generic function remove()which calls deleteNode() to delete the node. Define the generic function deleteNode() which deletes the node stored in the variable num and it calls the makeDeletion() function to delete a particular node passed inside the argument. Define the generic function makeDeletion()which takes the reference to a pointer to delete the node and the brances of the tree corresponding below the node are reattached. Define the generic function displayInOrder()to display the values in the subtree pointed by the node pointer. Define the generic function getTreeHeight() to count the height of the tree. Define the generic function TreeHeight()which calls getTreeHeight() to display the height of the tree. In main() function, Create a tree with integer data type to hold the integer values. Call the function treeHeight() to print the initial height of the tree. Call the function insertNode() to insert the node in a tree. Call the function displayInOrder() to display the nodes inserted in the order. Call the function remove() to remove the nodes from tree. Call the function treeHeight() to print the height of the tree after deleting the nodes.

Question

Want to see the full answer?

Answer 1

Question

Chapter 20, Problem 4PC

Program Plan Intro

Height of the Binary Tree

Program Plan:

Create a template prefix and define the template class BinaryTree to perform the following functions:

Declare the required variables.

Declare the function prototypes.

Define the no-argument generic constructor BinaryTree() to initialize the root value as null.

Call the functions insertNode(), remove(), displayInOrder(), and treeHeight().

Define the generic function insert() to insert the node in position pointed by the tree node pointer in a tree.

Define the generic function insertNode() to create a new node and it should be passed inside the insert() function to insert a new node into the tree.

Define the generic function remove()which calls deleteNode() to delete the node.

Define the generic function deleteNode() which deletes the node stored in the variable num and it calls the makeDeletion() function to delete a particular node passed inside the argument.

Define the generic function makeDeletion()which takes the reference to a pointer to delete the node and the brances of the tree corresponding below the node are reattached.

Define the generic function displayInOrder()to display the values in the subtree pointed by the node pointer.

Define the generic function getTreeHeight() to count the height of the tree.

Define the generic function TreeHeight()which calls getTreeHeight() to display the height of the tree.

In main() function,

Create a tree with integer data type to hold the integer values.

Call the function treeHeight() to print the initial height of the tree.

Call the function insertNode() to insert the node in a tree.

Call the function displayInOrder() to display the nodes inserted in the order.

Call the function remove() to remove the nodes from tree.

Call the function treeHeight() to print the height of the tree after deleting the nodes.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

The Horse table has the following columns: ID - integer, auto increment, primary key RegisteredName - variable-length string Breed - variable-length string Height - decimal number BirthDate - date Delete the following rows: Horse with ID 5 All horses with breed Holsteiner or Paint All horses born before March 13, 2013 To confirm that the deletes are correct, add the SELECT * FROM HORSE; statement.

Why is Linux popular? What would make someone choose a Linux OS over others? What makes a server? How is a server different from a workstation? What considerations do you have to keep in mind when choosing between physical, hybrid, or virtual server and what are the reasons to choose a virtual installation over the other options?

Objective you will: 1. Implement a Binary Search Tree (BST) from scratch, including the Big Five (Rule of Five) 2. Implement the TreeSort algorithm using a in-order traversal to store sorted elements in a vector. 3. Compare the performance of TreeSort with C++'s std::sort on large datasets. Part 1: Understanding TreeSort How TreeSort Works TreeSort is a comparison-based sorting algorithm that leverages a Binary Search Tree (BST): 1. Insert all elements into a BST (logically sorting them). 2. Traverse the BST in-order to extract elements in sorted order. 3. Store the sorted elements in a vector. Time Complexity Operation Average Case Worst Case (Unbalanced Tree)Insertion 0(1log n) 0 (n)Traversal (Pre-order) 0(n) 0 (n)Overall Complexity 0(n log n) 0(n^2) (degenerated tree) Note: To improve performance, you could use a…