PAL Definice Fibonacciho halda
Loosely based on Binomial Heap, but with more relaxed constrains.
Representation
Fibonacci Tree
- We can cut at most one child of each non-root node.
- When a second child is cut, the node itself needs to be cut from its parent and becomes the root of a new tree.
Structure
Doubly linked list of node,
operations
Merge
Connect doubly cyclic linked list and update pointer to min