Q16

MSQ1 mark

Which of the following statement(s) is/are TRUE for any binary search tree (BST) having $n$ distinct integers?

(A)

The maximum length of a path from the root node to any other node is $(n-1)$ .

(B)

An inorder traversal will always produce a sorted sequence of elements.

(C)

Finding an element takes $O\left(\log _{2} n\right)$ time in the worst case.

(D)

Every BST is also a Min-Heap.

Loading…