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 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-
From the Combined Bank Officer (IT) October 2024 – Preliminary (BIBM) exam, question 75 of 95.
More from this paper
- Previous: Which of the following symbol table implementation is best suited if access time is to be minimum?
- Next: Suppose you are given a binary tree with 11 nodes, such that each node has exactly either zero or two children. The maximum height of the…
- All questions in Combined Bank Officer (IT) October 2024 – Preliminary (BIBM)