Question 21
What is the expected search time in a height-balanced BST with n nodes?
Detailed Solution
A height-balanced BST has height Θ(log n).
✓ Saved
GATE CSE Trees – Data Structures Practice Test | Set 1
Your score
0/100
0 answered
Correct 0
Incorrect 0
Unanswered 100
Accuracy 0%
Question 22
Which rotation fixes an AVL insertion in the left-left case?
Detailed Solution
An LL imbalance is repaired by a single right rotation.
✓ Saved
Question 23
Which rotation fixes an AVL insertion in the right-right case?
Detailed Solution
An RR imbalance is repaired by a single left rotation.
✓ Saved
Question 24
Which AVL case requires a double rotation of left then right?
Detailed Solution
An LR imbalance is repaired by left rotation of the child followed by right rotation of the node.
✓ Saved
Question 25
Which AVL case requires a double rotation of right then left?
Detailed Solution
An RL imbalance is repaired by right rotation of the child followed by left rotation of the node.
✓ Saved