Trees & BST

Numerical answer

Single correct

• A4
• B2
• C10
• D5

Numerical answer

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$\Theta(n \log n)$
• B$\Theta(n)$
• C$\Theta(\log n)$
• D$\Theta(1)$

Answer key coming soon

Single correct

• A4 and 15 respectively
• B3 and 14 respectively
• C4 and 14 respectively
• D3 and 15 respectively

Answer key coming soon

Single correct

• A63 and 6, respectively
• B64 and 5, respectively
• C32 and 6, respectively
• D31 and 5, respectively

Single correct

• AI and IV only
• BII and III only
• CII and IV only
• DII only

Single correct

• A$\Theta(\log n)$ for both insertion and deletion
• B$\Theta(n)$ for both insertion and deletion
• C$\Theta(n)$ for insertion and $\Theta(\log n)$ for deletion
• D$\Theta(\log n)$ for insertion and $\Theta(n)$ for deletion

Numerical answer