Trees & BST

One or more correct

• AThe maximum length of a path from the root node to any other node is $(n - 1)$.
• BAn inorder traversal will always produce a sorted sequence of elements.
• CFinding an element takes $O(\log_2 n)$ time in the worst case.
• DEvery BST is also a Min-Heap.

Single correct

• A$\dfrac{n-2}{2}$
• B$\dfrac{n-1}{2}$
• C$\dfrac{n}{2}$
• D$\dfrac{n+1}{2}$

Numerical answer