void function ( WhereElement arg0 ) { while ( arg0 != null ) { stack . push ( arg0 ) ; if ( arg0 . getLeftChild ( ) != null ) { arg0 = arg0 . getLeftChild ( ) ; } else { arg0 = arg0 . getRightChild ( ) ; } } }
find the first leaf in a tree rooted at cur and store intermediate nodes concode_field_sep Stack<WhereElement> stack concode_field_sep WhereElement next concode_elem_sep boolean hasNext concode_elem_sep void remove