Which of the following statements about binary trees is correct?
A) Each node in a binary tree has at least two child nodes.
B) Each node in a binary tree has at most two child nodes.
C) The number of child nodes for each node in a binary tree is any power of two.
D) If divided down the middle from top to bottom, a binary tree must be symmetrical.

Question

Quizplus · Accepted Answer

In a binary tree, each node can have at most two child nodes, which are typically referred to as the left child and the right child.

Which of the Following Statements About Binary Trees Is Correct