aud.BinaryTreeTraversal< T > Class Template Reference

Provide traversals of binary trees. More...

Classes
class	Inorder
	helper: generates InorderIterator More...
class	InorderIterator
	inorder iterator for BinaryTree More...
class	Levelorder
	helper: generates LevelorderIterator More...
class	LevelorderIterator
	level-order iterator for BinaryTree More...
class	Postorder
	helper: generates PostorderIterator More...
class	PostorderIterator
	postorder iterator for BinaryTree More...
class	Preorder
	helper: generates PreorderIterator More...
class	PreorderIterator
	preorder iterator for BinaryTree More...
class	RecursiveTraversalIterator
	base class for stack-based pre-/in-/postorder traversal More...
class	Traversal
	Base class for traversal. More...

Public Member Functions
Preorder	preorder (BinaryTree< T > tree)
	return instance of generator More...
Inorder	inorder (BinaryTree< T > tree)
	return instance of generator More...
Postorder	postorder (BinaryTree< T > tree)
	return instance of generator More...
Levelorder	levelorder (BinaryTree< T > tree)
	return instance of generator More...

Detailed Description

Provide traversals of binary trees.

Defines iterators and classes generating iterators for various traversal orders.

See also

aud.BinaryTree

aud.example.BinaryTreeTraversal example.BinaryTreeTraversal (recursive traversion demo)

Definition at line 14 of file BinaryTreeTraversal.java.

Member Function Documentation

inorder()

Inorder aud.BinaryTreeTraversal< T >.inorder

(

BinaryTree< T >

tree

)

return instance of generator

See also

BinaryTree::inorder

Definition at line 119 of file BinaryTreeTraversal.java.

                                             {
    return new Inorder(tree);
  }

Referenced by aud.BinaryTree< T >.inorder().

Here is the caller graph for this function:

levelorder()

Levelorder aud.BinaryTreeTraversal< T >.levelorder

(

BinaryTree< T >

tree

)

return instance of generator

See also

BinaryTree::levelorder

Definition at line 246 of file BinaryTreeTraversal.java.

                                                   {
    return new Levelorder(tree);
  }

Referenced by aud.BinaryTree< T >.levelorder().

Here is the caller graph for this function:

postorder()

Postorder aud.BinaryTreeTraversal< T >.postorder

(

BinaryTree< T >

tree

)

return instance of generator

See also

BinaryTree::postorder

Definition at line 205 of file BinaryTreeTraversal.java.

                                                 {
    return new Postorder(tree);
  }

Referenced by aud.BinaryTree< T >.postorder().

Here is the caller graph for this function:

preorder()

Preorder aud.BinaryTreeTraversal< T >.preorder

(

BinaryTree< T >

tree

)

return instance of generator

See also

BinaryTree::preorder

Definition at line 77 of file BinaryTreeTraversal.java.

                                               {
    return new Preorder(tree);
  }

Referenced by aud.BinaryTree< T >.preorder().

Here is the caller graph for this function:

---

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

• BinaryTreeTraversal.java