|
|
|
|
complete binary tree
|
(Definition)
|
|
|
A complete binary tree is a binary tree with the additional property that every node must have exactly two “children” if an internal node, and zero children if a leaf node.
More precisely: for our base case, the complete binary tree of exactly one node is simply the tree consisting of that node by itself. The property of being “complete” is preserved if, at each step, we expand the tree by connecting exactly zero or two individual nodes (or complete binary trees) to any node in the tree (but both must be connected to the same node.)
|
"complete binary tree" is owned by akrowne.
|
|
(view preamble)
Cross-references: connected, expand, tree, base case, leaf node, children, internal node, node, property, binary tree
There are 16 references to this entry.
This is version 4 of complete binary tree, born on 2002-02-28, modified 2002-03-08.
Object id is 2736, canonical name is CompleteBinaryTree.
Accessed 9964 times total.
Classification:
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
