GATE 2017 Previous Year Paper Solution Question 5 – Computer Science
In this video the question which was asked in the exam of GATE 2017, has been discussed.
Question :- 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.
A. 4 and 15 respectively
B. 3 and 14 respectively
C. 4 and 14 respectively
D. 3 and 15 respectively
Solution is explained in the video.
