s.java

void reheapDown(int i) {
  int left = i*2 +1;
  int right = i*2 +2;
  
  if (right < size) {
    int largerChild;
    if (heap[left] >= heap[right]) {
      largerChild = left;
    } else {
      largerChild = right;
    }
    T parent = heap[i];
    heap[i] = heap[largerChild];
    heap[largerChild] = parent;
    reheapDown(largerChild);
  } else if (left < size) {
    
    T parent = heap[i];
    heap[i] = heap[left];
    heap[left] = parent;
    reheapDown(left);
  }