void function ( ) { TestCase . assertTrue ( tree . contains ( 9 ) ) ; TestCase . assertFalse ( tree . contains ( 14 ) ) ; BinarySearchTree < Integer > . Node loc0 = tree . get ( - 3 ) ; TestCase . assertTrue ( tree . contains ( loc0 ) ) ; loc0 = tree . new Node ( - 3 ) ; TestCase . assertFalse ( tree . contains ( loc0 ) ) ; }
tests the contains method . concode_field_sep BinarySearchTree<Integer> tree concode_field_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 iterator concode_elem_sep void size concode_elem_sep void balance concode_elem_sep void get concode_elem_sep void getMinimum concode_elem_sep void setup concode_elem_sep void removeNotFound