Improve The Save Children Method In Fibonacci Heap

[nishantc1527]

In the Fibonacci Heap, when I delete the min node while also trying to save the children, I lazily add all the children next to it. This is O(lg n), but it is possible to reduce it to O(1) by merging the children list with the one above. For help or merging, see this post.

Points: 15