aud.BinaryTreeTraversal< T >.LevelorderIterator Class Reference

level-order iterator for BinaryTree More...

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

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

Public Member Functions
boolean	hasNext ()
void	remove ()
BinaryTree< T >	next ()
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

level-order iterator for BinaryTree

Definition at line 211 of file BinaryTreeTraversal.java.

Member Function Documentation

hasNext()

boolean aud.BinaryTreeTraversal< T >.LevelorderIterator.hasNext

(

)

Definition at line 219 of file BinaryTreeTraversal.java.

                                       {
      return !queue_.is_empty();
    }

next()

BinaryTree< T > aud.BinaryTreeTraversal< T >.LevelorderIterator.next

(

)

Definition at line 227 of file BinaryTreeTraversal.java.

                                          {
      BinaryTree<T> node=queue_.dequeue(); // may throw!
      if (node.getLeft()!=null)  queue_.enqueue(node.getLeft());
      if (node.getRight()!=null) queue_.enqueue(node.getRight());
      return node;
    }

remove()

void aud.BinaryTreeTraversal< T >.LevelorderIterator.remove

(

)

Exceptions

UnsupportedOperationException

(not implemented)

Definition at line 223 of file BinaryTreeTraversal.java.

                                   {
      throw new UnsupportedOperationException();
    }

---

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

• BinaryTreeTraversal.java