What is an AVL tree?

› Category: Questions › What is an AVL tree?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

What is an AVL tree?
 
(a) a tree which is balanced and is a height balanced tree
 
(b) a tree which is unbalanced and is a height balanced tree
 
(c) a tree with three children
 
(d) a tree with atmost 3 children
 
My question is based upon AVL Tree in chapter Binary Trees of Data Structures & Algorithms I
 
This question was posed to me in exam.

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

Right choice is (a) a tree which is balanced and is a height balanced tree
 
Explanation: It is a self balancing tree with height difference atmost 1.


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: 40701

Related Posts