Width 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(),displayInOrder(), and treeHeight()and getWidth(). Define the generic function insert() to insert the node in pointed by the tree node pointer in a tree. Define the generic function insertNode() to create a new node and it is passed inside the insert() function to insert a new node into the tree. . 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. Define the generic function numAtLevel() to calculate the number of levels until the desired level is reached. Define the generic function getWidth() which calls the numAtLevel() function to count the width of the tree. In main() function, Create a tree with integer data type to hold the integer values. Declare the array testvalues[] and initialize it with the values. Use for loop to insert the values of testvalues[] array inside the binary tree using insertNode(). Call the function displayInOrder() to display the nodes inserted in the order. Call the function treeHeight() to print the height of the tree after insertion. Call the function getWidth() to print the width of the tree after insertion. Display the height and width of the tree.

Question

Want to see the full answer?

Answer 1

Question

Chapter 21, Problem 5PC

Program Plan Intro

Width 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(),displayInOrder(), and treeHeight()and getWidth().

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

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

.

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.

Define the generic function numAtLevel() to calculate the number of levels until the desired level is reached.

Define the generic function getWidth() which calls the numAtLevel() function to count the width of the tree.

In main() function,

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

Declare the array testvalues[] and initialize it with the values.

Use for loop to insert the values of testvalues[] array inside the binary tree using insertNode().

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

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

Call the function getWidth() to print the width of the tree after insertion.

Display the height and width of the tree.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Add to the BinarySearchTree class a member function string smallest() const that returns the smallest element of the tree. Provide a test program to test your function. #include <iostream>#include <string>using namespace std;class TreeNode{public:void insert_node(TreeNode* new_node);void print_nodes() const;bool find(string value) const;private:string data;TreeNode* left;TreeNode* right;friend class BinarySearchTree;};class BinarySearchTree{public:BinarySearchTree();void insert(string data);void erase(string data);int count(string data) const;void print() const;private:TreeNode* root;};BinarySearchTree::BinarySearchTree(){root = NULL;}void BinarySearchTree::print() const{if (root != NULL)root->print_nodes();}void BinarySearchTree::insert(string data){TreeNode* new_node = new TreeNode;new_node->data = data;new_node->left = NULL;new_node->right = NULL;if (root == NULL) root = new_node;else root->insert_node(new_node);}void TreeNode::insert_node(TreeNode*…

Text concordance using BST 1 Project description Write a cross-reference program that constructs a binary search tree (any type, including splay tree) with all words included from a text file and records the positions (word or line numbers) on which these words were used. These line numbers should be stored on linked lists associated with the nodes of the tree. After the input file has been processed, print in alphabetical order all words of the text file along with the corresponding list of numbers of the lines in which the words occur. 2 What to turn in You will turn in a short written report containing: A description of the significant choices/issues in the design of your code. The source-code of your program. 3 Coding standards A percentage of your grade will be based on the quality of your code, so pay attention to it. Discuss changes (if any) you made to programs presented in class. Take extra care in documenting the code you are implementing on your…

Programming questions：typedef struct node { int data; struct node *left, *right;}BT;The node structure of the binary tree (BT) is shown above. There is a binary tree T, please complete the function: int degreeone(BT *T) to compute how many degree 1 node in the BT. The T is the root pointer, and the function shoule return the total number of degree 1 node.