(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 1 February 2005.
HTML page formatted Mon Sep 11 09:46:02 2006.
Cite this as:
Paul E. Black, "complete tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 1 February 2005. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/completetree.html
