/guava/guava/src/com/google/common/collect/TreeTraverser.java
return !queue.isEmpty ( ) ;
BreadthFirstIterator(T root) { this.queue = new ArrayDeque<T>(); queue.add(root); } @Override public boolean hasNext() { <extra_id_0> } @Override public T peek() { return queue.element(); } @Override