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

  1. Complete binary tree

  2. Binary search tree

  3. Extended binary tree

  4. None of above


Correct Option: C

Find more quizzes: