find the smallest item in the priority queue . concode_field_sep PairNode<AnyType> leftChild concode_elem_sep int theSize concode_elem_sep PairNode<AnyType> prev concode_elem_sep PairNode<AnyType> root concode_elem_sep PairNode<AnyType> nextSibling concode_elem_sep AnyType element concode_elem_sep PairNode<AnyType>[] treeArray concode_field_sep AnyType getValue concode_elem_sep AnyType getValue concode_elem_sep int size concode_elem_sep PairNode<AnyType> compareAndLink concode_elem_sep void makeEmpty concode_elem_sep boolean isEmpty concode_elem_sep Position<AnyType> insert concode_elem_sep AnyType deleteMin concode_elem_sep PairNode<AnyType> combineSiblings concode_elem_sep void decreaseKey concode_elem_sep void main concode_elem_sep PairNode<AnyType>[] doubleIfFull
AnyType function ( ) { if ( isEmpty ( ) ) throw new UnderflowException ( ) ; return root . element ; }