// Introduction to Algorithms
// Template for HeapDown.sift_down() - 
// do HeapUp first, as it's easier
// <put your name, login name & student number here>

class HeapDown implements HeapSiftingDown {

    // Try to make it work for BOTH ROOT=1 and ROOT=0
    // without change the rest of the code!
    private final static int ROOT = 1;
    public int root () { return ROOT; }

    public int parent      (int child)  { return ???; }
    public int left_child  (int parent) { return ???; }
    public int right_child (int parent) { return ???; }
    public int sibling     (int child)  { return ???;}
    public void choice (int c) {}

    public void sift_down (int[] A, int bubble, int contents) {
    }
}