A binary search tree with N integers may have height ___________ in the best…
NVS Computer Science / IT Teacher Recruitment · 2022 · PGT Computer Science · 15 Dec 2022 · Shift 2 · Computer Science or Information Technology
A binary search tree with N integers may have height ___________ in the best case, and __________ in the worst case.
- A.
O(N), O(N)
- B.
O(N2), N
- C.
O(log2N), O(N2)
- D.
O(log2N), N−1
Attempted by 44 students.
Sign up free to check your answer
Sign up freeLoading lesson…