public IBinaryTreeNode<T> next(){
  if (stack.empty()) {
    throw new java.util.NoSuchElementException("Binary Traversal Iterator has no more elements");
  }
  Moment m=stack.peek();
  advance();
  return m.node;
}

public IBinaryTreeNode < T > next ( ) { if ( stack . empty ( ) ) { throw new java . util . NoSuchElementException ( "Binary Traversal Iterator has no more elements" ) ; } Moment m = stack . peek ( ) ; advance ( ) ; return m . node ; }
returns the next node in the traversal .
