A binary search tree is constructed by inserting the numbers, 60 25 72 15 30 68 13 18 in order. The number of nodes in the left sub tree is-
- A.4
- B.5
- C.6
- D.8
Show answer
Answer: B. 5
The root is 60. Values smaller than 60 are 25, 15, 30, 13, and 18 (5 nodes).