Let T be a binary search tree with 15 nodes. The minimum and

Please wait...
THANKU FOR BEING A PART OF OUR JOURNEY TO BRING "REVOLUTION IN EDUCATION"
We Genuinely APPRECIATE your PATIENCE

SKINS
ADS

Red
Pink
Purple
Deep Purple
Indigo
Blue
Light Blue
Cyan
Teal
Green
Light Green
Lime
Yellow
Amber
Orange
Deep Orange
Brown
Grey
Blue Grey
Black
White

Coming Soon

34

M: +1.00/-0.33

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:
Note: The height of a tree with a single node is 0.

[GATE CS 2017 Set 1]

A 4 and 15 respectively

B 3 and 14 respectively

C 4 and 14 respectively

D 3 and 15 respectively