aud.BinaryTreeTraversal< T >.RecursiveTraversalIterator Class Reference

base class for stack-based pre-/in-/postorder traversal More...

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

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

Public Member Functions
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

base class for stack-based pre-/in-/postorder traversal

Definition at line 35 of file BinaryTreeTraversal.java.

Member Function Documentation

hasNext()

boolean aud.BinaryTreeTraversal< T >.RecursiveTraversalIterator.hasNext

(

)

Reimplemented in aud.BinaryTreeTraversal< T >.PostorderIterator.

Definition at line 44 of file BinaryTreeTraversal.java.

                                       {
      return !stack_.is_empty();
    }

remove()

void aud.BinaryTreeTraversal< T >.RecursiveTraversalIterator.remove

(

)

Exceptions

UnsupportedOperationException

(not implemented)

Definition at line 48 of file BinaryTreeTraversal.java.

                                   {
      throw new UnsupportedOperationException();
    }

---

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

• BinaryTreeTraversal.java