The shortest tree is a perfectly balanced one. A complete binary tree with 15 nodes has 4 full levels, so its height is 3. The tallest tree is a chain of 15 nodes, whose height is 14.
More Trees and Binary Search Trees questions
GATE 2014 CS (CS1) Q22– A rooted n-node binary tree is represented using pointers. The best upper bound for…
GATE 2014 CS (CS2) Q49– Each leaf of the shown expression tree independently has value 0 or 1. Find the maximum…
GATE 2014 CS (CS3) Q22– In the rooted tree shown, P is the root. In what order are the nodes visited during an…
GATE 2014 CS (CS3) Q49– A balanced BST T holds n numbers. To sum the m numbers between given L and H, the tightest…
GATE 2014 CS (CS3) Q51– An arbitrary tree uses leftMostChild–rightSibling representation. When its root is passed…
GATE 2016 CS (CS2) Q21– BFS starts at the root of a binary tree. A vertex t is at distance four. If t is the n-th…