Multiple choice technology architecture

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
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

An extended binary tree (also called a full binary tree or proper binary tree) is defined as a binary tree where every node has either 0 or 2 children - never just 1 child. A complete binary tree fills all levels except possibly the last, which must be left-filled. A binary search tree is ordered by key values, not by child count. Option C is correct.

Keep practicing — related questions