Vidyalelo
Data Structure · Q142

Binary Search Trees(B Tree)

Programming · Data Structure · question 142

Q142

When it would be optimal to prefer Red-black trees over AVL trees?

A.
when there are more insertions or deletions
Answer
B.
when more search is needed
C.
when tree must be balanced
D.
when log(nodes) time complexity is needed

Answer: Option A

Solution

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