Question: Which of the following statements about binary trees is true?

Options:

1. A binary tree can have at most two children per node.
2. A binary tree must be balanced.
3. A binary tree can only have integer values.
4. A binary tree cannot be empty.

Correct Answer: A binary tree can have at most two children per node.

Solution:

A binary tree is defined as a tree data structure in which each node has at most two children, often referred to as the left and right child.