Question

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.

Answer 1

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.