Vidyalelo
Data Structure · Q252

Binary Search Trees(B Tree)

Programming · Data Structure · question 252

Q252

What is the prime condition of AA-tree which makes it simpler than a red-black tree?

A.
Only right children can be red
Answer
B.
Only left children can be red
C.
Right children should strictly be black
D.
There should be no left children

Answer: Option A

Solution

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