AVL trees are more balanced than Red-black trees.

› Category: Questions › AVL trees are more balanced than Red-black trees.
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

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.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months ago

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.


Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702

Related Posts