What is a full binary tree?

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

What is a full binary tree?
 
(a) Each node has exactly zero or two children
 
(b) Each node has exactly two children
 
(c) All the leaves are at the same level
 
(d) Each node has exactly one or two children
 
My question is taken from Binary Tree Properties in portion Binary Trees of Data Structures & Algorithms I
 
The question was asked during an online exam.

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

The correct choice is (a) Each node has exactly zero or two children
 
Easy explanation – A full binary tree is a tree in which each node has exactly 0 or 2 children.


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