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

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

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

A.
\(θ (log \ n)\) for both insertion and deletion
B.
\(θ(n)\) for both insertion and deletion
C.
\(θ(n)\) for insertion and \(θ (log \ n)\) for deletion
D.
\(θ (log \ n)\) for insertion and \(θ(n)\) for deletion

Attempted by 1274 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2