Which statement about trees is false?
A)A tree is a nonlinear,two-dimensional data structure.
B)Each node in a tree must contain two links.
C)The children of a node are called siblings.
D)A node with no children is called a leaf node.

Question

Quizplus · Accepted Answer

Each node in a tree can have any number of links, including zero or one. In fact, a node with only one link is called a "special case" or a "degenerate" node, and it can be found in some types of trees, such as binary search trees. Therefore, statement B is false as it states that each node in a tree must contain two links.

Which Statement About Trees Is False