// Introduction to Algorithms
// Template for HeapUp.sift_up()
// <put your name, login name & student number here>

class HeapUp implements HeapSiftingUp {

    public int root () { return ROOT; }
    private final static int ROOT = 0;

    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_up (int[] A, int bubble, int contents) {


    }
}