Question

If a binary tree of depth is "d", then when can we say that it is an almost complete binary tree
(A) Each leaf in the tree is either at level “d" or at level “d-1".
For any noden in the tree with a right descendent at level "d" all the left descendants of
(B)
leaves, are also at level "d".
(C) Both A and B.
None of the above​

Answer 1

Answer:

A binary tree of depth d is an almost complete binary tree if: Each leaf in the tree is either at level d or at level d - 1. For any node nd in the tree with a right descendant at level d, all the left descendants of nd that are leaves are also at level d.

Answer 2

Answer:

A binary tree of depth d is an almost complete binary tree if: Each leaf in the tree is either at level d or at level d - 1. For any node nd in the tree with a right descendant at level d, all the left descendants of nd that are leaves are also at level d.

Answer 3

Answer:

A binary tree of depth d is an almost complete binary tree if: Each leaf in the tree is either at level d or at level d - 1. For any node nd in the tree with a right descendant at level d, all the left descendants of nd that are leaves are also at level d.