A binary tree is a collection of nodes in which
A) each node has at most one predecessor and at most one successor
B) each node has at most one predecessor and exactly two successors
C) each node has at most one predecessor and at most two successors
D) each node has at least one predecessor and at most two successors

Question

Quizplus · Accepted Answer

In a binary tree, each node can have at most one predecessor (parent) and at most two successors (children).

A Binary Tree Is a Collection of Nodes in Which