BINOMIAL HEAP

Domain	Definition
Math	A priority queue made of a forest of binomial trees with the heap property numbered k=0, 1, 2, ..., n, each containing either 0 or 2k nodes. Each tree is formed by linking two of its predecessors, by joining one at the root of the other. The operations of insert a value, decrease a value, delete a value, and merge or join (meld) two queues take O( log n) time. The find minimum operation is a constant (1). (references)
Source: compiled by the editor from various references; see credits.

Specialty Definition: Binomial heap

In computer science, a Binomial Heap is a set of binomial trees that satisfy binomial heap properties:

Each binomial tree in the heap obeys the min-heap property: the key of a node is greater than or equal to the key of its parent.
For any non-negative integer j, there is at most one binomial tree in the heap whose root has degree j.

The properties tell us that the root of a binomial tree contains the smallest key in the tree and that an n-node binomial heap consists of at most lg n + 1 binomial trees.

TODO: Draw a graphic rep of a b. heap

Anagrams: BINOMIAL HEAP

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "a-a-b-e-h-i-i-l-m-n-o-p"
	-3 letters: amphibian, amphibole, nemophila, neophilia.
	-4 letters: amphibia, aphelian, aphelion, binomial, bohemian, hemiolia, phelonia.
	-5 letters: abalone, abelian, aeolian, amboina, amiable, amoeban, aphelia, aphonia, apnoeal, biplane, bohemia, epinaoi, hambone, hemiola, hipbone, hipline, hobnail, impanel, laminae, lampion, mahonia, manhole, maniple, minable, minilab, namable, omphali, opaline, pembina, pinhole.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.