Test.java

  public void insert(int p){
    //Hint: remember to update size.  Also, remember that we skip index 0 in the array.
    /*Your code here */

    if (this.size == 0) {
      // if array is empty
      elts[1] = p;
    } else if (this.size != max) {
      // if the size isn't already at max
      // set spot at the end of heap to new value
      elts[size + 1] = p;
      // recursively bubble up the last value to the right place
      bubbleUp(size + 1);
    }
    this.size ++;
  }

  private void bubbleUp(int child) {
    int parent = child/2;
    // calculate parent of child element

    if (parent > 0 && elts[parent] > elts[child]) {
      // if parent is still in range and is GREATER than the child
      int temp = elts[child];
      elts[child] = elts[parent];
      elts[parent] = temp;
      // swap element and continue to bubble up
      bubbleUp(parent);
    }
  }