Teaching HPSC Lecturer (Technical) Mock Test 2024 Programming and Data Structure Binary Heap Binary Search Tree
What are the worst-case complexities of insertion and deletion of a key in a binary search tree?
1
θ (log n) for both insertion and deletion
2
θ (n) for both insertion and deletion
3
θ (n) for insertion and θ (log n) for deletion
4
θ (log n) for insertion and θ (n) for deletion
5
Question Not Attempted