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 descendent at level “d” all the left descendents of “n” that are leaves, are also at level “d”

[C] Both (A) & (B)

[D] None of the above