Definition: An ordered tree of order k ≥ 0, that is Bk, whose root has 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, pages 401 and 402]. CLR90 numbers the children k-1, k-2, ..., 0, making child i a binomial tree of order i. This definition numbers the children from 1 to k.
Binomial heap in Wikipedia.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 9 August 2007.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "binomial tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 9 August 2007. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/binomialtree.html