A binary tree is balanced if the difference between left and right subtree of every node is not more than ____

› Category: Questions › A binary tree is balanced if the difference between left and right subtree of every node is not more than ____
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

A binary tree is balanced if the difference between left and right subtree of every node is not more than ____
 
(a) 1
 
(b) 3
 
(c) 2
 
(d) 0
 
The question is from Binary Trees in portion Binary Trees of Data Structures & Algorithms I
 
I got this question during an online exam.

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

Right option is (a) 1
 
Best explanation: In a balanced binary tree the heights of two subtrees of every node never differ by more than 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: 40702

Related Posts