treeAlgorithms/TreeBuilder.java

Go to the documentation of this file.

package treeAlgorithms;

public class TreeBuilder<T extends Comparable<T>> {
    private TreeNode<T> mRoot = null;

    public TreeBuilder() {
    }

    public TreeBuilder(TreeNode<T> root) {
        this.mRoot = root;
    }

    public TreeBuilder(T[] vals) {
        if (vals != null) {
            for (T val : vals) {
                this.addNode(val);
            }
        }
    }

    protected boolean addNode(TreeNode<T> root, T newVal) {
        Comparable<T> rootVal = root.getValue();
        boolean found = true;
        if (rootVal.compareTo(newVal) == 0) {
            found = true;
        } else if (rootVal.compareTo(newVal) < 0) {
            if (root.getRight() != null) {
                addNode(root.getRight(), newVal);
            } else {
                TreeNode<T> newNode = new TreeNode<T>(newVal);
                root.setRight(newNode);
            }
        } else if (rootVal.compareTo(newVal) > 0) {
            if (root.getLeft() != null) {
                addNode(root.getLeft(), newVal);
            } else {
                TreeNode<T> newNode = new TreeNode<T>(newVal);
                root.setLeft(newNode);
            }
        }
        return found;
    }

    public boolean addNode(T newVal) {
        boolean found = false;
        if (newVal != null) {
            if (mRoot == null) {
                TreeNode<T> newNode = new TreeNode<T>(newVal);
                mRoot = newNode;
            } else {
                found = addNode(mRoot, newVal);
            }
        }
        return found;
    }

    public TreeNode<T> getTree() {
        return mRoot;
    }
}