Q. A binary tree of depth "d" is an almost complete binary tree if __________. (Solved)
1. each leaf in the tree is either at level.
2. for any node.
3. both a and b.
4. None.
- c. both a and b.
1. each leaf in the tree is either at level.
2. for any node.
3. both a and b.
4. None.