🎴 Flashcard Mode
architecture Online Quiz - 34
Card1 / 20
Mastered0
Review0
QuestionClick to flip
A binary tree whose every node has either zero or two children is called
AnswerClick to flip back
A
Extended binary tree
💡 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.