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 20, 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

struct remove_from_front_of_dll { // Function takes no parameters, removes the book at the front of a doubly // linked list, and returns nothing. void operator()(const Book& unused) { //// TO-DO (13) |||| // Write the lines of code to remove the book at the front of "my_dll", // // Remember, attempting to remove an element from an empty data structure is // a logic error. Include code to avoid that. ///// END-TO-DO (13) //// } std::list& my_dll; };

Concatenate Map This function will be given a single parameter known as the Map List. The Map List is a list of maps. Your job is to combine all the maps found in the map list into a single map and return it. There are two rules for addingvalues to the map. You must add key-value pairs to the map in the same order they are found in the Map List. If the key already exists, it cannot be overwritten. In other words, if two or more maps have the same key, the key to be added cannot be overwritten by the subsequent maps. Signature: public static HashMap<String, Integer> concatenateMap(ArrayList<HashMap<String, Integer>> mapList) Example: INPUT: [{b=55, t=20, f=26, n=87, o=93}, {s=95, f=9, n=11, o=71}, {f=89, n=82, o=29}]OUTPUT: {b=55, s=95, t=20, f=26, n=87, o=93} INPUT: [{v=2, f=80, z=43, k=90, n=43}, {d=41, f=98, y=39, n=83}, {d=12, v=61, y=44, n=30}]OUTPUT: {d=41, v=2, f=80, y=39, z=43, k=90, n=43} INPUT: [{p=79, b=10, g=28, h=21, z=62}, {p=5, g=87, h=38}, {p=29,…

struct insert_at_back_of_dll { // Function takes a constant Book as a parameter, inserts that book at the // back of a doubly linked list, and returns nothing. void operator()(const Book& book) { / // TO-DO (2) |||| // Write the lines of code to insert "book" at the back of "my_dll". // // // END-TO-DO (2) ||| } std::list& my_dll; };