Vidyalelo
Data Structure · Q44

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 44

Q44

Which of the following is true for Red-Black trees?

A.
They guarantee balanced height but not exact height.
Answer
B.
They guarantee exact height balancing.
C.
They do not support deletion.
D.
They are balanced using a different method.

Answer: Option A

Solution

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