treeAlgorithms/TreeNode.java

Go to the documentation of this file.

package treeAlgorithms;

import java.util.Iterator;

public class TreeNode<T extends Comparable<T>> implements Iterable<TreeNode<T>> {
    private Comparable<T> mValue;
    private TreeNode<T> mRight = null;
    private TreeNode<T> mLeft = null;

    public TreeNode<T> getLeft() {
        return mLeft;
    }

    public void setLeft(TreeNode<T> node) {
        this.mLeft = node;
    }

    public TreeNode<T> getRight() {
        return mRight;
    }

    public void setRight(TreeNode<T> node) {
        this.mRight = node;
    }

    public TreeNode(Comparable<T> value) {
        this.mValue = value;
    }

    public Comparable<T> getValue() {
        return mValue;
    }

    public void setValue(Comparable<T> newVal) {
        this.mValue = newVal;
    }

    protected void printTree(TreeNode<T> root, String indent) {
        if (root != null) {
            System.out.println(indent + root);
            String newIndent = indent + "  ";
            for (TreeNode<T> elem : root) {
                printTree(elem, newIndent);
            }
        }
    } // printTree

    public void printTree() {
        printTree(this, "");
    }

    @Override
    public Iterator<TreeNode<T>> iterator() {
        Iterator<TreeNode<T>> itr = new TreeNodeIterator<T>(this);
        return itr;
    }

    @Override
    public String toString() {
        return this.getValue().toString();
    }

}