BinaryNode function ( BinaryNode arg0 ) { if ( arg0 == null ) throw new ItemNotFoundException ( ) ; else if ( arg0 . left != null ) { arg0 . left = removeMin ( arg0 . left ) ; return arg0 ; } else return arg0 . right ; }
internal method to remove minimum item from a subtree . concode_field_sep BinaryNode left concode_elem_sep BinaryNode root concode_elem_sep BinaryNode right concode_elem_sep Comparable element concode_field_sep Comparable find concode_elem_sep BinaryNode find concode_elem_sep void makeEmpty concode_elem_sep boolean isEmpty concode_elem_sep Comparable elementAt concode_elem_sep void insert concode_elem_sep BinaryNode insert concode_elem_sep void main concode_elem_sep Comparable findMin concode_elem_sep BinaryNode findMin concode_elem_sep void remove concode_elem_sep BinaryNode remove concode_elem_sep Comparable findMax concode_elem_sep BinaryNode findMax