A

Admin • 833.24K Points
Coach

Q. A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.

  • (A) Threaded tree
  • (B) Complete binary tree
  • (C) M-way search tree
  • (D) Full binary tree

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.