33 votes 33 votes 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$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively. DS gatecse-2017-set1 data-structures binary-search-tree easy + – Arjun asked Feb 14, 2017 • edited Jun 25, 2018 by Pooja Khatri Arjun 16.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes for max height in Binary search should in skewed form. Therefore max height will be n-1=15-1=14 for min-height binary search tree (or any binary tree) = lowerbound(log2 n) AkDS rajput singh answered Aug 12, 2018 AkDS rajput singh comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes OPtion B Vasudevarnabmessi answered Mar 18, 2023 Vasudevarnabmessi comment Share Follow See all 0 reply Please log in or register to add a comment.