Vidyalelo
Data Structure · Q10

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 10

Q10

What is the primary difference between a Red-Black tree and an AVL tree?

A.
AVL trees are more rigidly balanced.
Answer
B.
Red-Black trees have stricter balancing.
C.
AVL trees use color-coding.
D.
Red-Black trees do not require rotations.

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board