boolean function ( Node < Value > arg0 ) { if ( arg0 == null ) return false ; Node < Value > loc0 = insert ( root , arg0 ) ; if ( root == null ) { root = loc0 ; } return ( loc0 != null ) ; }
inserts a node into the existing tree . concode_field_sep Node<Value> root concode_field_sep ArrayList<LinkedList<Node<Value>>> buildLinkedListByLevel concode_elem_sep void printByLevel concode_elem_sep void printInOrder concode_elem_sep void printInOrder concode_elem_sep Node<Value> findParentNode concode_elem_sep void byLevel concode_elem_sep boolean find concode_elem_sep Node<Value> find concode_elem_sep void printZigZagOrder concode_elem_sep void main concode_elem_sep int rangeSum concode_elem_sep int rangeSum