treeAlgorithms/TreeNodeIterator.java

Go to the documentation of this file.

package treeAlgorithms;

import java.util.ArrayList;
import java.util.Iterator;

public class TreeNodeIterator<T extends Comparable<T>> implements
        Iterator<TreeNode<T>> {
    private ArrayList<TreeNode<T>> mSiblings;
    private int ix;

    public TreeNodeIterator(TreeNode<T> treeNode) {
        ix = 0;
        mSiblings = new ArrayList<TreeNode<T>>();
        if (treeNode != null) {
            if (treeNode.getLeft() != null) {
                mSiblings.add(treeNode.getLeft());
            }
            if (treeNode.getRight() != null) {
                mSiblings.add(treeNode.getRight());
            }
        }
    }

    @Override
    public boolean hasNext() {
        return (ix < mSiblings.size());
    }

    @Override
    public TreeNode<T> next() {
        TreeNode<T> nextVal = null;
        if (hasNext()) {
            nextVal = mSiblings.get(ix);
            ix++;
        }
        return nextVal;
    }

    @Override
    public void remove() {
        // Not implemented
    }
}