src/main/java/com/googlecode/javaewah/datastructure/PriorityQ.java
public T poll() {
        T ans = this.a[1];
        this.a[1] = this.a[this.lastIndex--];
        percolateDown(1);
        return ans;
    }
public T poll() {
        T ans = this.a[1];
        this.a[1] = this.a[this.lastIndex--];
        percolateDown(1);
        return ans;
    }
public T poll ( ) { T ans = this . a [ 1 ] ; this . a [ 1 ] = this . a [ this . lastIndex -- ] ; percolateDown ( 1 ) ; return ans ; }
Remove the element on top of the heap

@return the element being removed
Remove the element on top of the heap