ExpressionNode function ( ExpressionNode [ ] arg0 ) { root = arg0 [ 0 ] ; return createTreePrivate ( arg0 , myindex , root ) ; }
converts a boolean function in the form a preordered array of expressionnodes , each of which is either a variable or an operator , to a usable expressiontree concode_field_sep int index concode_elem_sep Index myindex concode_elem_sep Stack<ExpressionNode> stack concode_elem_sep ExpressionNode root concode_field_sep ExpressionNode next concode_elem_sep String print concode_elem_sep Iterator<ExpressionNode> iterator concode_elem_sep String inOrderIter concode_elem_sep boolean isEmpty concode_elem_sep boolean hasNext concode_elem_sep ExpressionNode createTreePrivate