A set of nodes T is a binary tree if either of the following is true:
• __________
• If T is not empty, it has a root node r with 0, 1, or 2 binary subtrees whose roots are connected to r by a branch.
A) T is complete
B) T is balanced
C) T is full
D) T is empty

Question

Quizplus · Accepted Answer

A binary tree can be empty, which is a base condition for defining a binary tree. If it's not empty, it must have a root node that could have up to two subtrees.

A Set of Nodes T Is a Binary Tree If