Computer Science · Data Structures and Algorithms
Which of the following statements are TRUE regarding AVL search trees for representing a dictionary of n elements? (i) The height of an AVL tree with n nodes is O(log n). (ii) Search operation in an n-element AVL tree takes O(log n) time. (iii) Insertion in an n-element AVL tree can be done in O(log n) time. (iv) Deletion in an n-element AVL tree can be done in O(log n) time.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1i, ii, iii, and iv✓
- 2ii and iv only
- 3i, ii, and iii only
- 4i and ii only
Correct answer
i, ii, iii, and iv
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