void function ( TreeNode arg0 ) { int loc0 = root . value . compareTo ( value ) ; if ( loc0 < 0 ) { if ( left == null ) { left = arg0 ; } else left . addTreeNode ( arg0 ) ; } else if ( loc0 > 0 ) { if ( right == null ) { right = arg0 ; } else right . addTreeNode ( arg0 ) ; } }
this method adds a new tree nodes and adjusts the tree structure as we add the new node concode_field_sep List<TreeNode> children concode_elem_sep TreeNode left concode_elem_sep TreeNode root concode_elem_sep TreeNode right concode_elem_sep Comparable<Object> value concode_field_sep void add concode_elem_sep void addSubtree concode_elem_sep void print concode_elem_sep void print concode_elem_sep boolean searchForLeaf concode_elem_sep void postTraversal concode_elem_sep void preTraversal