Correct answer: (B) $\Theta(n)$ for both insertion and deletion
Explanation
A binary search tree is not guaranteed to be balanced. In the worst case it becomes a chain of $n$ nodes, so both finding the place to insert and finding the node to delete take $\Theta(n)$.
More Trees and Binary Search Trees questions
GATE 2017 CS (CS1) Q16– Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T…
GATE 2014 CS (CS1) Q22– A rooted n-node binary tree is represented using pointers. The best upper bound for…
GATE 2014 CS (CS2) Q49– Each leaf of the shown expression tree independently has value 0 or 1. Find the maximum…
GATE 2014 CS (CS3) Q22– In the rooted tree shown, P is the root. In what order are the nodes visited during an…
GATE 2014 CS (CS3) Q49– A balanced BST T holds n numbers. To sum the m numbers between given L and H, the tightest…
GATE 2014 CS (CS3) Q51– An arbitrary tree uses leftMostChild–rightSibling representation. When its root is passed…