Q23

MCQ1 mark, −0.33

What are the worst-case complexities of insertion and deletion of a key in a binary search tree?

(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

Loading…