make the priority queue logically empty . concode_field_sep int size concode_elem_sep PairNode root concode_elem_sep PairNode[] treeArray concode_field_sep PairNode addItem concode_elem_sep PairNode compareAndLink concode_elem_sep boolean isEmpty concode_elem_sep PairNode insert concode_elem_sep int deleteMin concode_elem_sep PairNode combineSiblings concode_elem_sep void decreaseKey concode_elem_sep void main concode_elem_sep PairNode[] doubleIfFull concode_elem_sep int findMin
void function ( ) { size = 0 ; root = null ; }