Computer Science · Binary Search Tree
In a binary search tree (BST) containing n nodes, under which condition does searching for a key take Θ(log n) time in the worst case?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1The tree is height-balanced✓
- 2The tree is skewed
- 3The tree has no duplicates
- 4Keys are inserted randomly
Correct answer
The tree is height-balanced
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 Binary Search Tree MCQs →Want more practice questions on Binary Search Tree?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Binary Search Tree