+1 vote
in Data Structures & Algorithms I by (110k points)
AVL trees are more balanced than Red-black trees.

(a) True

(b) False

The origin of the question is Binary Trees in portion Binary Trees of Data Structures & Algorithms I

I got this question in an interview for job.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right choice is (a) True

The best I can explain: AVL tree is more balanced than a Red-black tree because AVL tree has less height than Red-black tree given that both trees have the same number of elements.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.