/guava/guava/src/com/google/common/collect/TreeTraverser.java
stack.getLast( ) ;
stack.addLast ( expand ( root ) ) ;
} } private final class PostOrderIterator extends AbstractIterator<T> { private final ArrayDeque<PostOrderNode<T>> stack; PostOrderIterator(T root) { this.stack = new ArrayDeque<>(); <extra_id_0> } @Override @CheckForNull protected T computeNext() { while (!stack.isEmpty()) { PostOrderNode<T> top = stack.getLast();