Binary tree - Conditions - Data Structure

Q.  If a binary tree of depth is “ d ”, then when can we say that it is an almost complete binary tree?
- Published on 26 Aug 15

a. Each leaf in the tree is either at level “ d ” or at level “ d –1 ” .
b. For any node “ n ” in the tree with a right descendent at level “ d ” all the left descendants of “ n ” that are leaves, are also at level “ d ”.
c. Both A and B.
d. None of the above.

ANSWER: Both A and B.

Post your comment / Share knowledge


Enter the code shown above:
 
(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)