Vidyalelo
Data Structure · Q52

Binary Search Trees(B Tree)

Programming · Data Structure · question 52

Q52

Why to prefer red-black trees over AVL trees?

A.
Because red-black is more rigidly balanced
B.
AVL tree store balance factor in every node which costs space
Answer
C.
AVL tree fails at scale
D.
Red black is more efficient

Answer: Option B

Solution

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