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

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…

how to read log logs

Discrete Mathematics for Computer Engineering