Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Tree Depth of Tree
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R.
Assertion A: The AVL trees are more 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 height that is greater than 2 log2 (n + 1) and the AVL tree with n nodes has height less than logΦ (√5 (n+2)) -2 (where Φ is golden ratio)
In the light of the above statements, choose the correct answer from the options given below.
1
Both A and R are correct and R is the correct explanation of A
2
Both A and R are correct and R is NOT the correct explanation of A
3
A is true but R is false
4
A is false but R is true