BinaryNode function ( BinaryNode arg0 ) { if ( arg0 != null ) while ( arg0 . left != null ) arg0 = arg0 . left ; return arg0 ; }
internal method to find the smallest item in 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 void removeMin concode_elem_sep BinaryNode removeMin concode_elem_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 void remove concode_elem_sep BinaryNode remove concode_elem_sep Comparable findMax concode_elem_sep BinaryNode findMax