Vidyalelo
Data Structure · Q21

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 21

Q21

What is the primary advantage of using a Red-Black tree over an AVL tree?

A.
AVL trees are faster for insertion.
B.
Red-Black trees have a simpler implementation.
C.
AVL trees use less memory.
D.
Red-Black trees require fewer rotations.
Answer

Answer: Option D

Solution

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