Which of the following statement(s) is/are TRUE for any binary search tree…
PYQ GATE 2025
Which of the following statement(s) is/are TRUE for any binary search tree (BST) having 𝑛 distinct integers?
- A.
The maximum length of a path from the root node to any other node is
. - B.
An inorder traversal will always produce a sorted sequence of elements
- C.
Finding an element takes
time in the worst case. - D.
Every BST is also a Min-Heap.
Attempted by 316 students.
Sign up free to check your answer
Sign up freeLoading lesson…

