c++ The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocodebelow is invoked as height(root) to compute the height of a binary tree rooted at the tree pointer root.int height (treeptr n){ if (nNULL)return -1;3D%3Dif (n → leftNULL)==if (n → rightNULL) return 0;=D3=else returnB1// Box 1else { hlheightif (n → rightreturn (1+h1);(n → left);NULL)==else { h2height (n –→ right);returnB2// Box 2}}}The appropriate expressions for the two boxes B1and B2 areSelect one:O a. B1: (1 + height (n → right)) B2: (1 + max (h1, h2))O b. B1: (height (n → right)) B2: (1 + max (h1, h2))O c. B1: height (n → right) B2: max (h1, h2)O d. B1: (1 + height (n → right)) B2: max (h1, h2)

The code given to find the height of a binary tree rooted at the tree pointer root: int height…

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below is invoked as height(root) to compute the height of a binary tree rooted at the tree pointer root. int height { if (n if (n → left if (n → right (treeptr n) NULL) return -1; 3D%3D NULL) == NULL) return 0; =D%3D else return B1 // Box 1 else { h1 height (n → left); if (n → right NULL) == return (1+h1); else { h2 return | B2| ; height (n –→ right); // Box 2 } } } The appropriate expressions for the two boxes B1 and B2 are Select one: a. B1: (1 + height (n right)) B2: (1 + max (h1, h2)) O b. B1: (height (n right)) B2: (1 + max (h1,h2)) O c. B1: height (n right) B2: max (h1, h2) O d. B1: (1 + height (n right)) B2: max (h1, h2)

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below is invoked as height(root) to compute the height of a binary tree rooted at the tree pointer root. int height { if (n if (n → left if (n → right (treeptr n) NULL) return -1; 3D%3D NULL) == NULL) return 0; =D%3D else return B1 // Box 1 else { h1 height (n → left); if (n → right NULL) == return (1+h1); else { h2 return | B2| ; height (n –→ right); // Box 2 } } } The appropriate expressions for the two boxes B1 and B2 are Select one: a. B1: (1 + height (n right)) B2: (1 + max (h1, h2)) O b. B1: (height (n right)) B2: (1 + max (h1,h2)) O c. B1: height (n right) B2: max (h1, h2) O d. B1: (1 + height (n right)) B2: max (h1, h2)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Evaluate the following arithmetic expression as the C++ system would evaluate it. 12 /4 3 * 2
C++ works from bottom to top O True O False
Create a C++ programme that counts the total digits in a number.
Prime ,perfect, palindrom using function in c++ programm
Write a C++ Program to produce the first 100 fibonacci numbers
Write a C program that takes the input string from the user and prints the number of vowels in the string. It must be written in the c language.(thank you )
1. What is the String Statement? 2. How do you execute String Statement in C programming?
Create a code in C ++ whose function is to convert a decimal number to an octal one
Prime Number Program in C++
Create a C++ programme that displays the factorial of an integer.
40- A C++ code line ends with • A Semicolon (;) • A Comma (,) • A Full stop(.) • A Slash (/)