for( int i=1;i<n.getChildCount();i++) {
for( int i=0;i<n.getChildCount();i++) {
  private boolean isDeletiaModified(BranchNode n, MergeList ml) {    BaseNode m = n.getBaseMatch();    if( m == null )      return true; // the node was inserted => modified    if( getOperation(m,ml) != NOP ) // Notice that we check for move instantly, but updates only when                                    // we know the node was deleted. This is because moves are                                    // visible on the previous level w.r.t. the updates      return true; // the node has been moved    if( n.getBaseMatchType() != BranchNode.MATCH_FULL )      return true; // either structural or content modification (otherwise match would be full!)                   // NOTE: By definition of a natural matching, at least one match is full!    boolean deletedInOther = n.getPartners().getMatches().isEmpty();    if( deletedInOther ) {      if( !matches( n, m ) )        return true; // The node is updated      // Check children      MergeList mlistN = makeMergeList(n);      for( int i=1;i<n.getChildCount();i++) { // Strange ixes because we ignore start & end symbols        if( isDeletiaModified( n.getChild(i), mlistN ) )          return true;      }      return false; // got trough the children (recursively), no modifications    } else      return false; // No modification here, and no recurse needed (the node has a structmatch in the other tree)  }