find the largest item in the tree . concode_field_sep BinaryNode<AnyType> left concode_elem_sep BinaryNode<AnyType> root concode_elem_sep BinaryNode<AnyType> right concode_elem_sep AnyType element concode_field_sep boolean contains concode_elem_sep boolean contains concode_elem_sep void makeEmpty concode_elem_sep boolean isEmpty concode_elem_sep void insert concode_elem_sep BinaryNode<AnyType> insert concode_elem_sep void main concode_elem_sep AnyType findMin concode_elem_sep BinaryNode<AnyType> findMin concode_elem_sep void remove concode_elem_sep BinaryNode<AnyType> remove concode_elem_sep void printTree concode_elem_sep void printTree concode_elem_sep int height
AnyType function ( ) { if ( isEmpty ( ) ) throw new UnderflowException ( ) ; return findMax ( root ) . element ; }