A binary tree of depth "d" is an almost complete binary tree if __________.
|A.||each leaf in the tree is either at level.|
|B.||for any node.|
|C.||both a and b.|
|Answer» C. both a and b.|
Login to Continue
It will take less than 2 minutes