Computer Science · Data Structures
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: AVL trees are more strictly balanced as compared to Red-Black trees, but they may cause more rotations during insertion and deletion. Reason R: A Red-Black tree with n nodes has a height that is strictly greater than 2 log2(n + 1). In the light of the above statements, choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Both A and R are correct and R is the correct explanation of A
- 2Both A and R are correct and R is NOT the correct explanation of A
- 3A is true but R is false✓
- 4A is false but R is true
Correct answer
A is true but R is false
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 MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures