Programming and Data Structures Test 5

Result

Programming and Data Structures Test 5

Score
-
out of -
Rank
-
out of -

TIME Taken - -

SHARING IS CARING

If our Website helped you a little, then kindly spread our voice using Social Networks. Spread our word to your readers, friends, teachers, students & all those close ones who deserve to know what you know now.

Weekly Quiz Competition

Question 1
1 / -0

Consider a binary search tree consisting of 127 nodes. The height of the binary search tree with one node is 0. If maximum and minimum possible heights of the binary search tree is H and h then which of the following is/are true?

A
h × H = 756

B
| h – H | = 56

C
H ÷ h = 21

D
h + H = 131

Solution

If n is number of nodes and h is minimum height of in a binary search tree, then
2h+1 – 1 = n
2h+1 – 1 = 127
2h+1 = 128
2h+1 = 26+1
∴ h = 6
If n is number of nodes and H is maximum height of in a binary search tree, then
H = n – 1
H = 127 -1
∴ H = 126
h×H = 756
| h – H | = 120
H ÷ h = 21
h + H = 132

Login to see Solution & AIR