void function ( ) { TestCase . assertFalse ( tree . remove ( 7 ) ) ; BinarySearchTree < Integer > . Node loc0 = tree . new Node ( - 3 ) ; TestCase . assertFalse ( tree . remove ( loc0 ) ) ; }
tests the remove methods with non-existing values . concode_field_sep BinarySearchTree<Integer> tree concode_elem_sep double GOLDEN_RATIO concode_field_sep double getHeightLimit concode_elem_sep void getDepth concode_elem_sep void isEmpty concode_elem_sep void clear concode_elem_sep void insert concode_elem_sep void getMaximum concode_elem_sep void remove concode_elem_sep void contains concode_elem_sep void iterator concode_elem_sep void size concode_elem_sep void get concode_elem_sep void getMinimum concode_elem_sep void setup