A binary tree of depth "d" is an almost complete binary tree if. 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 descendant at level "d" all the left descendants of "n" that are leaves, are also at level "d"