Considering the height of a binary tree as the number of edges between the…
DSSSB TGT/PGT · 2018 · PGT Computer Science (Male) · 27 Jul 2018 · Shift 2 · Section II: subject
Considering the height of a binary tree as the number of edges between the tree's root and its furthest leaf, what is the height of the binary search tree created using the following key values (in order)?
19, 14, 18, 15, 16, 13, 12
- A.
3
- B.
4
- C.
5
- D.
6
Attempted by 590 students.
Sign up free to check your answer
Sign up freeLoading lesson…