AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.BinaryTreeTraversal< T >.RecursiveTraversalIterator Class Referenceabstract

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...
 

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.

44 {
45 return !stack_.is_empty();
46 }

◆ remove()

void aud.BinaryTreeTraversal< T >.RecursiveTraversalIterator.remove ( )
Exceptions
UnsupportedOperationException(not implemented)

Definition at line 48 of file BinaryTreeTraversal.java.

48 {
49 throw new UnsupportedOperationException();
50 }

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