Question 26

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

Create a FREE account and get:

Download Maths Shortcuts PDF
Get 300+ previous papers with solutions PDF
500+ Online Tests for Free

CAT Quant Questions | CAT Quantitative Ability

CAT Algebra Questions CAT Data Sufficiency Questions CAT Time, Distance and Work Questions CAT Number Systems Questions CAT Linear Equations Questions

CAT DILR Questions | LRDI Questions For CAT

CAT DI with connected data sets Questions CAT Routes And Networks Questions CAT Special Charts Questions CAT Table with Missing values Questions CAT Selection With Condition Questions

CAT Verbal Ability Questions | VARC Questions For CAT

CAT Vocabulary Questions CAT Miscellaneous Questions CAT Odd One Out Questions CAT Verbal Ability Questions CAT Critical Reasoning Questions

Follow us on

Boost your Prep!

Download App