How to perform insertion in fibonacci heap?
In Fibonacci heap, insertion is adding a new tree with one node. And updating min element of the heap if applicable.
It is the extract min operation that is complex. I am attaching link to a document if you want to see extract min also.Fibonacci heap