(data structure)
Definition: A tree in which all leaf nodes are at some depth n or n-1, and all leaves at depth n are toward the left.
See also complete graph, complete binary tree.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Tue Feb 1 15:01:46 2005.
HTML page formatted Wed Oct 26 09:47:22 2005.
Cite this as:
Paul E. Black, "complete tree", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/completetree.html
