Every binary tree is either complete or full. Every complete binary tree is also a full binary tree. Every full binary tree is also a complete binary tree. No binary tree is both complete and full. Suppose T is a binary tree with 14 nodes.
Every binary tree has at least one node.
B. Every non-empty tree has exactly one root node. Every node has at most two children. Every non-root node has exactly one parent. For the tree in the box at the top of this section. For the tree in the box at the top of this section.