BinarySearchTree.java

public class BinarySearchTree extends BinaryTree {

    public BinarySearchTree() {
        super();
    }

    public void insert(Comparable item) {
        if(this.isEmpty())
            this.setRoot(new TreeNode(item));

        TreeNode p = null;
        TreeNode q = this.getRoot();
        while(q != null) {
            p = q;
            if(item.compareTo(p.getValue()) < 0)
                q = p.getLeft();
            else
                q = p.getRight();
        }

        if(item.compareTo(p.getValue()) < 0)
            p.setLeft(new TreeNode(item));
        else
            p.setRight(new TreeNode(item));
    }

    public TreeNode find(Comparable key) {
        TreeNode p = this.getRoot();
        while(p != null && key.compareTo(p.getValue()) != 0) {
            if(key.compareTo(p.getValue()) < 0)
                p = p.getLeft();
            else
                p = p.getRight();
        }
        return p;
    }

    // public BinarySearchTree swapSubtrees() {

    // }

    public void inorder() {
        doInorderTraversal(this.getRoot());
    }

    private void doInorderTraversal(TreeNode t) {
        if(t != null) {
            doInorderTraversal(t.getLeft());
            System.out.println(t.getValue());
            doInorderTraversal(t.getRight());
        }
    }

} // end of class