A

Admin • 833.24K Points
Coach

Q. A binary tree whose every node has either zero or two children is called

  • (A) Complete binary tree
  • (B) Binary search tree
  • (C) Extended binary tree
  • (D) None of above

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.