In a full binary tree if number of internal nodes is I, then number of leaves L are?

› Category: Questions › In a full binary tree if number of internal nodes is I, then number of leaves L are?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

In a full binary tree if number of internal nodes is I, then number of leaves L are?
 
(a) L = 2*I
 
(b) L = I + 1
 
(c) L = I – 1
 
(d) L = 2*I – 1
 
My query is from Binary Tree Properties in division Binary Trees of Data Structures & Algorithms I
 
The question was asked in examination.

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

Right choice is (b) L = I + 1
 
The best explanation: Number of Leaf nodes in full binary tree is equal to 1 + Number of Internal Nodes i.e L = I + 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