Category:Binomial heap

From LiteratePrograms
Jump to: navigation, search

A binomial heap is a concrete heap data structure constructed using a forest of binomial trees. Binomial heaps perform all operations in O(log n) time, and unlike binary heaps, support an O(log n) operation to (destructively) merge two heaps into one.

This category currently contains no pages or media.