A

Admin • 833.24K Points
Coach

Q. 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.
  • (D) None.

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.