If a binary tree of depth is d , then when can we say that it is an almost complete binary tree?

Each leaf in the tree is either at level d or at level d 1 .

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 .

If a binary tree of depth is d , then when can we say that it is an al

1.	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 .
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» D. None of the above.