Computer Science · Data Structures and Algorithms
Which of the following statements is TRUE regarding the time complexity of searching operations?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1The cost of searching an AVL tree is θ(n log n) but that of a binary search tree is θ(n)
- 2The cost of searching a binary tree is O(log n) but that of an AVL tree is θ(n)
- 3The cost of searching an AVL tree is θ(log n) but that of a complete binary tree is θ(n log n)
- 4The cost of searching an AVL tree is θ(log n) but that of an unindexed binary search tree in the worst case is O(n)✓
Correct answer
The cost of searching an AVL tree is θ(log n) but that of an unindexed binary search tree in the worst case is O(n)
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