aud.BinaryTreeTraversal< T >.PostorderIterator Class Reference

postorder iterator for BinaryTree More...

Inheritance diagram for aud.BinaryTreeTraversal< T >.PostorderIterator:

Collaboration diagram for aud.BinaryTreeTraversal< T >.PostorderIterator:

Public Member Functions
boolean	hasNext ()
BinaryTree< T >	next ()
Public Member Functions inherited from aud.BinaryTreeTraversal< T >.RecursiveTraversalIterator
boolean	hasNext ()
void	remove ()
Public Member Functions inherited from aud.SList< T >.Iterator< BinaryTree< T > >
boolean	hasNext ()
	return true unless "advanced" over tail More...
T	next ()
	return current entry and advance More...
void	remove ()
	not implemented More...
boolean	equals (Object other)

Detailed Description

postorder iterator for BinaryTree

Definition at line 125 of file BinaryTreeTraversal.java.

Member Function Documentation

hasNext()

boolean aud.BinaryTreeTraversal< T >.PostorderIterator.hasNext

(

)

Reimplemented from aud.BinaryTreeTraversal< T >.RecursiveTraversalIterator.

Definition at line 164 of file BinaryTreeTraversal.java.

                                       {
      assert(stack_.is_empty()==state_.is_empty()); // additional check
      return super.hasNext();
    }

next()

BinaryTree< T > aud.BinaryTreeTraversal< T >.PostorderIterator.next

(

)

Definition at line 169 of file BinaryTreeTraversal.java.

                                          {
      int state;
      while ((state=state_.pop())!=OUTPUT) {
        if (state==LEFT) {
          // stack_.top() remains
          state_.push(RIGHT);
 
          descendLeft();
        }
        else {
          // stack_.top() remains
          state_.push(OUTPUT);
 
          BinaryTree<T> node=stack_.top();
          if (node.getRight()!=null) {
            stack_.push(node.getRight());
            state_.push(LEFT);
          }
        }
      }
      return stack_.pop(); // state == OUTPUT
    }

---

The documentation for this class was generated from the following file:

• BinaryTreeTraversal.java