Initial organization of the prfoling code for the Binomial heaps. Corrected bugs in the following methods:
- BinomialHeaps.getDegree was reporting the incorect degree as it was always reporting the degre of the first node. The mehod was rewritten to chain down the list until it finds the last node and report its degree.

- BinomiallHeaps.Min_Degree() was returning the incorect BinomialHeap when the second input parameter was null o r NIL.  The method was fixed by verifying only the prospect return value. An empty Binomial tree is returned if they prospect is in fact null or NIL.

- BinomialHeap.Binomial_HeapMerge() was incorectly returning the merger of two BinomialHeaps and some nodes were being lost. The methods was rewritten from scratch and streamlined.

- NinomialNode.BinomialNode(BinomialNode): The copy constructor was not properly duplicating the degree of the reference node.