complete binary tree

A complete binary treeMathworldPlanetmathPlanetmath is a binary treeMathworldPlanetmath with the additional property that every node must have exactly two “children” if an internal nodePlanetmathPlanetmath, 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 “completePlanetmathPlanetmathPlanetmathPlanetmath” 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.)

Title complete binary tree
Canonical name CompleteBinaryTree
Date of creation 2013-03-22 12:30:14
Last modified on 2013-03-22 12:30:14
Owner akrowne (2)
Last modified by akrowne (2)
Numerical id 7
Author akrowne (2)
Entry type Definition
Classification msc 05C05
Synonym complete
Related topic ExtendedBinaryTree