Computer Science · Data Structures and Algorithms
In an unbalanced Binary Search Tree (BST), what is the worst-case time complexity of inserting and deleting a key respectively?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(log n) for insertion and O(log n) for deletion
- 2O(n) for insertion and O(log n) for deletion
- 3O(n) for insertion and O(n) for deletion✓
- 4O(log n) for insertion and O(n) for deletion
Correct answer
O(n) for insertion and O(n) for deletion
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms