Binary Search Tree (BST) Worst-Case Complexity: Insertion & Deletion

Computer Sciences > Gate 2015 Set-1 > Binary Search Tree

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

Θ(logn) for both insertion and deletion

Θ(n) for both insertion and deletion

Θ(n) for insertion and Θ(logn) for deletion

Θ(logn) for insertion and Θ(n) for deletion

Correct : Binary Search Tree

Similar Questions

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree with a single node is 0.

#211 MCQ

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree with a single node is 0.

#211 MCQ

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree with a single node is 0.

#211 MCQ