Binomial Heap Merge
Merge two heaps by linking trees of equal degree like binary addition.
Binomial and Fibonacci Heaps: Merge two binomial heaps
Degree 0: 2 trees, rooted at 55, 8. Two of a kind: link them, and the result is a B1 that joins the next degree.
Cost
- Best
- O(log n)
- Average
- O(log n)
- Worst
- O(log n)
- Space
- O(1)
Before this
Taught by the same lesson
Binomial and Fibonacci Heaps covers these too, in the same run.