else { final int node = _node; _node = _nextSibling[node]; return returnNode(node); }
current = _node; _node = last; return returnNode(current);
	public int next() {	    if (_node == _start) {		return NULL;	    }	    else {		final int node = _node;		_node = _nextSibling[node];		return returnNode(node);	    }	}