![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656503964082-Article.jpg\")
<\/p>\n<\/p>\n
Fibonacci heap is a data structure which collectionis a collection of trees having max heap or min-heap properties. These two properties are the characteristics of the fibonacci heap tree. In Fibonacci heaps, trees can be of any shape even if all the trees can have a single node. <\/p>\n
In this, Node may have more than two childrens or no childrens at all.<\/p>\n
Fibonacci heap has efficient operations as compared to binary and binomial heap.<\/p>\n
As, in the name clearly mentioned, fibonacci means the fibonacci heap is constructed in such a way that the tree with order n has Fn+2 nodes where Fn+2 is the fibonacci number.<\/p>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656504010630-Image-02.png\")
<\/p>\n
In the Fibonacci heap, the roots of all the trees are linked together for better and faster access.<\/p>\n
1. Insertion:<\/strong> To insert a node in the Fibonacci heap, we will follow the following algorithm.<\/p>\n Algorithm:<\/strong><\/p>\n Create a new node \u2018d\u2019.<\/p>\n<\/li>\n Check if the existing heap is empty or not.<\/p>\n<\/li>\n If the heap is empty:<\/p>\n<\/li>\n Make \u2018d\u2019 the only node in the heap.<\/p>\n<\/li>\n Set a min pointer to the \u2018d\u2019.<\/p>\n<\/li>\n Else insert \u2018d\u2019 into the heap and update the heap.<\/p>\n<\/li>\n<\/ul>\n 2. Union:<\/strong> Union of two Fibonacci heaps is done as follows:<\/p>\n Let’s consider two Fibonacci heaps h1 and h2.<\/p>\n Algorithm:<\/strong><\/p>\n\n
\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656504057218-Image-01.png\")
<\/p>\nCode Implementation<\/h3>\n\t\t\t\t\t\t