![]() |
AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
|
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.BinarySearchTree.Iterator< BinaryTree< T > > | |
| boolean | hasNext () |
| Cursor | next () |
| void | remove () |
| not implemented More... | |
base class for stack-based pre-/in-/postorder traversal
Definition at line 35 of file BinaryTreeTraversal.java.
| boolean aud.BinaryTreeTraversal< T >.RecursiveTraversalIterator.hasNext | ( | ) |
Reimplemented in aud.BinaryTreeTraversal< T >.PostorderIterator.
Definition at line 44 of file BinaryTreeTraversal.java.
| void aud.BinaryTreeTraversal< T >.RecursiveTraversalIterator.remove | ( | ) |
| UnsupportedOperationException | (not implemented) |
Definition at line 48 of file BinaryTreeTraversal.java.