Question

true or false: a binary tree is defined as a finite set of nodes that is either empty or consists of a root node and two disjoint binary trees.
false
true

Explanation:

A binary tree is defined as a finite set of nodes that is either empty or consists of a root node and two disjoint binary trees (left - subtree and right - subtree). This is the standard definition of a binary tree.

Answer:

True