Comparable function ( ) { return elementAt ( findMin ( root ) ) ; }
find the smallest item in the tree . 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