void function ( E arg0 ) { size ++ ; root = insert ( arg0 , root ) ; }
inserts the given element into the proper position . no balancing occurs . concode_field_sep BSTNode<E> root concode_elem_sep int size concode_elem_sep T data concode_elem_sep TRAVERSAL traversal concode_elem_sep BSTNode<T> left concode_elem_sep BSTNode<T> right concode_field_sep E getSuccessor concode_elem_sep String prettyPrint concode_elem_sep void prettyPrint concode_elem_sep void clear concode_elem_sep boolean isEmpty concode_elem_sep E getPredecessor concode_elem_sep int compareTo concode_elem_sep boolean isLeaf concode_elem_sep void remove concode_elem_sep BSTNode<E> remove concode_elem_sep BSTNode<E> remove concode_elem_sep boolean contains concode_elem_sep boolean contains concode_elem_sep void postOrderTraversal concode_elem_sep int size concode_elem_sep E get concode_elem_sep E get concode_elem_sep void preOrderTraversal concode_elem_sep void setTraversal concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep void inorderTraversal concode_elem_sep String pDepth