/// <summary>
/// Unions this heap with another
/// O(log(n)) complexity
/// </summary>
/// <param name="binomialHeap"></param>
public void Union(BinomialMaxHeap <T> binomialHeap)
{
MergeSortedForests(binomialHeap.heapForest);
Meld();
Count += binomialHeap.Count;
}
/// <summary>
/// Time complexity: O(log(n)).
/// </summary>
/// <param name="binomialHeap">The heap to union with.</param>
public void Merge(BinomialMaxHeap <T> binomialHeap)
{
mergeSortedForests(binomialHeap.heapForest);
meld();
Count += binomialHeap.Count;
}
