array/Kth Largest Element in Array/java/solution.java
void replaceMax(int x)
    {
      this.harr[0] = x;
      minHeapify(0);
    }
// to replace root with new node x and heapify() new root
to replace root with new node x and heapify() new root
to replace root with new node x and heapify () new root
void replaceMax(int x)
    {
      this.harr[0] = x;
      minHeapify(0);
    }
void replaceMax ( int x ) { this . harr [ 0 ] = x ; minHeapify ( 0 ) ; }
to replace root with new node x and heapify() new root
to replace root with new node x and heapify () new root