Editing Rope (data structure) (section)

=== Collect leaves ===
: ''Definition:'' Create a stack ''S'' and a list ''L''.  Traverse down the left-most spine of the tree until you reach a leaf l', adding each node ''n'' to ''S''.  Add l' to ''L''. The parent of l' (''p'') is at the top of the stack.  Repeat the procedure for p's right subtree.

<syntaxhighlight lang="java">
final class InOrderRopeIterator implements Iterator<RopeLike> {

    private final Deque<RopeLike> stack;

    InOrderRopeIterator(@NonNull RopeLike root) {
        stack = new ArrayDeque<>();
        var c = root;
        while (c != null) {
            stack.push(c);
            c = c.getLeft();
        }
    }

    @Override
    public boolean hasNext() {
        return stack.size() > 0;
    }

    @Override
    public RopeLike next() {
        val result = stack.pop();

        if (!stack.isEmpty()) {
            var parent = stack.pop();
            var right = parent.getRight();
            if (right != null) {
                stack.push(right);
                var cleft = right.getLeft();
                while (cleft != null) {
                    stack.push(cleft);
                    cleft = cleft.getLeft();
                }
            }
        }

        return result;
    }
}
</syntaxhighlight>