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

Base class for traversal. More...

+ Inheritance diagram for aud.BinaryTreeTraversal< T >.Traversal:
+ Collaboration diagram for aud.BinaryTreeTraversal< T >.Traversal:

Public Member Functions

String toString ()
 

Detailed Description

Base class for traversal.

An instance creates iterators for a particular traversal.

Definition at line 19 of file BinaryTreeTraversal.java.

Member Function Documentation

◆ toString()

String aud.BinaryTreeTraversal< T >.Traversal.toString ( )

Definition at line 25 of file BinaryTreeTraversal.java.

25 {
26 String s="";
27 for (BinaryTree<T> node : this) {
28 s+=node.getData().toString()+",";
29 }
30 return s.substring(0,s.length()-1);
31 }

References aud.BinaryTree< T >.getData().

Referenced by aud.BinaryTree< T >.main(), aud.example.expr.ExpressionParser.main(), and aud.example.expr.ExpressionTree.main().

+ Here is the call graph for this function:
+ Here is the caller graph for this function:

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