GATE Computer Science (CS) 2015 Shift 1 Solved Paper

© examsiri.com

Question : 35 of 65

Marks: +1, -0

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

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

Go to Question:

Prev Question

Next Question