In computer science, a binomial heap is a heap similar to a binary heap but also supports quick merging of two heaps. This is achieved by using a special tree structure. It is important as an implementation of the mergeable heap abstract data type (also called meldable heap), which is a priority queue supporting merge operation.
Read more about Binomial Heap: Binomial Tree, Structure of A Binomial Heap, Implementation, Performance, Applications
Famous quotes containing the word heap:
“—First a shiver, and then a thrill,
Then something decidedly like a spill,—
And the parson was sitting up on a rock,
At half-past nine by the meet’n’-house clock,—
Just the hour of the Earthquake shock!
MWhat do you think the parson found,
When he got up and stared around?
The poor old chaise in a heap or mound,
As if it had been to the mill and ground!”
—Oliver Wendell Holmes, Sr. (1809–1894)