The given numbers are inserted into an empty binary search tree in the given order: ( 10,1,3,5,15,12 ) and 16 . \[\] What is the height of the binary search tree.
The height of a binary tree is defined as the length of the longest path from the root to a leaf node. Starting from the root (10): 1. Path 10 → 1 → 3: length = 3 \[\] 2. Path 10 → 1 → 5: length = 3 \[\] 3. Path 10 → 15 → 12: length = 3 \[\] 4. Path 10 → 15 → 16: length = 3 \[\] The longest path from the root to any leaf node is 3 edges, which means the height of this BST is 3. \[\] Correct Answer: (a)
Reinforce your conceptual grasp with related questions from CUET-MCA 2021:
Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.
Start Free Mock Test Series →