What are the worst-case complexities of insertion and deletion of a key in a…

GATE · 2015 · CS · Set 1 · Computer Science & IT

1. A.

   $θ (log \ n)$ for both insertion and deletion

2. B.

   $θ(n)$ for both insertion and deletion

3. C.

   $θ(n)$ for insertion and $θ (log \ n)$ for deletion

4. D.

   $θ (log \ n)$ for insertion and $θ(n)$ for deletion

Attempted by 1384 students.