(data structure)
Definition: An ordered tree of order k ≥ 0, that is Bk, has a root with k children where the ith child is binomial tree of order k-i.
See also binomial heap.
Note: A Bk tree has 2k nodes, the height is k, and there are k choose i nodes at depth i.
Adapted from [CLR90, page 401].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 11:48:26 2004.
HTML page formatted Wed Oct 26 09:47:15 2005.
Cite this as:
Paul E. Black, "binomial tree", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/binomialtree.html
