jdsl.core.ref
Class PostOrderIterator

java.lang.Object
  extended byjdsl.core.ref.PostOrderIterator
All Implemented Interfaces:
ObjectIterator, PositionIterator

public class PostOrderIterator
extends Object
implements PositionIterator

The postorder iterator gives a postorder traversal of any tree. Creating this iterator takes O(N) where N = the number of positions in the tree, assuming that root, rightChild, leftChild, isInternal are O(1) in the tree implementation. All other methods take O(1) time.

Version:
JDSL 2.1.1
Author:
Ryan Shaun Baker

Constructor Summary
PostOrderIterator(InspectableBinaryTree tree)
          Constructs a new PostOrderIterator to iterate over the given container Puts a reference to each position into the array -- takes O(N) time where N = the number of positions in the container
PostOrderIterator(InspectableTree tree)
          Constructs a new PostOrderIterator to iterate over the given container Puts a reference to each position into the array -- takes O(N) time where N = the number of positions in the container
 
Method Summary
 Object element()
          Takes O(1) time
 void first()
          Takes O(1) time Sets the current node to the first node.
 boolean hasNext()
          Takes O(1) time
 Object nextObject()
          Takes O(1) time
 Position nextPosition()
          Takes O(1) time
 Object object()
          Takes O(1) time
 Position position()
          Takes O(1) time
 void reset()
          Takes O(1) time Sets the current node to the first node.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

PostOrderIterator

public PostOrderIterator(InspectableBinaryTree tree)
Constructs a new PostOrderIterator to iterate over the given container Puts a reference to each position into the array -- takes O(N) time where N = the number of positions in the container

Parameters:
tree - The tree to iterate over

PostOrderIterator

public PostOrderIterator(InspectableTree tree)
Constructs a new PostOrderIterator to iterate over the given container Puts a reference to each position into the array -- takes O(N) time where N = the number of positions in the container

Parameters:
tree - The tree to iterate over
Method Detail

hasNext

public boolean hasNext()
Takes O(1) time

Specified by:
hasNext in interface ObjectIterator
Returns:
Whether there is at least one object still unseen

nextObject

public Object nextObject()
Takes O(1) time

Specified by:
nextObject in interface ObjectIterator
Returns:
Next object to consider

object

public Object object()
Takes O(1) time

Specified by:
object in interface ObjectIterator
Returns:
The object returned by the most recent next()

reset

public void reset()
Takes O(1) time Sets the current node to the first node.

Specified by:
reset in interface ObjectIterator

element

public Object element()
               throws NoSuchElementException
Takes O(1) time

Specified by:
element in interface PositionIterator
Returns:
Element of the position that would be returned by position()
Throws:
NoSuchElementException - When the iterator is in its initial, before-the-first-position state

nextPosition

public Position nextPosition()
Takes O(1) time

Specified by:
nextPosition in interface PositionIterator
Returns:
Next position to consider

position

public Position position()
                  throws NoSuchElementException
Takes O(1) time

Specified by:
position in interface PositionIterator
Returns:
The position returned by the most recent next()
Throws:
NoSuchElementException - When the iterator is in its initial, before-the-first-position state

first

public void first()
Takes O(1) time Sets the current node to the first node.