Fibonacci Heap - Insert, Extract Min and Union Operations
Operations by Fibonacci Heap
To allow fast deletion and concatenation, the roots of all trees are linked using a circular, doubly linked list. The children of each node are also linked using such a list. For each node, we maintain its number of children and whether the node is marked. Moreover, we maintain a pointer to the root containing the minimum key.
Ref: https://en.wikipedia.org/wiki/Fibonac...
Introduction to Algorithms by CLRS
some internet sources