public KthLargest()
{
Heap = new MinHeap <T>();
}
public MedianFinder()
{
largerElementMinHeap = new MinHeap <int>();
smallerElemenMaxHeap = new MaxHeap <int>();
}
public KwayMerge()
{
Heap = new MinHeap <ListNode>();
}
