TreeNode function ( TreeNode arg0 , int arg1 ) { if ( arg0 == null || arg0 . value == arg1 ) { return arg0 ; } if ( arg1 < arg0 . value ) { return find ( arg0 . left , arg1 ) ; } else { return find ( arg0 . right , arg1 ) ; } }
find a element in binary search tree concode_field_sep PlaceHolder placeHolder concode_field_sep void preOrderRecursive concode_elem_sep TreeNode deleteNode concode_elem_sep void inOrder concode_elem_sep void preOrder concode_elem_sep TreeNode minValueNode concode_elem_sep TreeNode addTreeNode concode_elem_sep boolean isBinarySearchTree concode_elem_sep boolean isBinarySearchTree concode_elem_sep void postOrderRecursive concode_elem_sep TreeNode createBST concode_elem_sep void postOrder concode_elem_sep void inOrderRecursive