|
|
a binary tree in which all interval nodes have degree and all leaves are at the same level
a binary tree in which all leaves are on the same level and every interior node has
a binary tree in which each level is completely filled
a binary tree in which every level, except possibly the deepest, is completely filled
binary tree (see binary tree) in which every simple path (see simple path) from the root down to a leaf has the same length and every non-leaf node has two children.
Refers to a decision tree where all branches, with the exception of the bottom, are completely filled with nodes.
|
