class Heap represents a min heap data structure.
Methods:
- Add method is for adding a new element to the heap
- GetSortedArray method implements heapsort and it returns a sorted array of numbers. Time complexity is O(N log N)
- RemoveMin() - removes the min element and returns it
- GetMin method - returns a min element with time complexity - O(1)