Binary Search Trees

You say that you have your data structures implemented, can you provide details on how you have implemented them?

hi,
unfortunatelly, your question is not clear too much. But if you don't know essential operations to use binray search tree you can check some theory at http://en.wikipedia.org/wiki/Binary_search_tree
Algorithms can be rewrite to Java.

JS

package javaappbtree;
// import java.util.Comparator;

/**
 * @author José Braga de Vasconcelos
 */
public class LinkedBinaryTree implements BinaryTree {
    // instance data member
    BinaryTreeNode root;
    // class data members
 
    public boolean isEmpty() {
        throw new UnsupportedOperationException("Not supported yet.");
    }

    // inserção ordenada
    public BinaryTreeNode insertBST(BinaryTreeNode node) {

        node.leftChild = null;
        node.rightChild = null;

        Comparable st1 = (Comparable) node.element;
       
        // if (bt == null) return node;
       
        BinaryTreeNode p = new BinaryTreeNode();
        p = this.root;
       
        while (true)
            if (st1.compareTo(p.element) < 0) {
                if (p.leftChild == null) {
                    p.leftChild = node;
                    return root;
                }
                else p = p.leftChild;
            }
            else if (p.rightChild == null) {
                     p.rightChild = node;
                     return root;
                 }
                 else p = p.rightChild;
        }

    // Attach node to the left of a specific node
    public void attachLeft(BinaryTreeNode node, BinaryTreeNode left) {
        node.leftChild = left;
    }
   
    // Attach node to the right of a specific node
    public void attachRight(BinaryTreeNode node, BinaryTreeNode right) {
        node.rightChild = right;
    }

    public BinaryTree removeLeft() {
        throw new UnsupportedOperationException("Not supported yet.");
    }

    public BinaryTree removeRight() {
        throw new UnsupportedOperationException("Not supported yet.");
    }

}



// class Binary Tree Node
package javaappbtree;
// visible data members
public class BinaryTreeNode
{
    Object element;
    BinaryTreeNode leftChild;
    BinaryTreeNode rightChild;

    //constructors
    public BinaryTreeNode() {}

    public BinaryTreeNode(Object theElement)
        {element = theElement;}
   
    public BinaryTreeNode(Object theElement,
            BinaryTreeNode theleftChild,
            BinaryTreeNode therightChild)
    {
        element = theElement;
        leftChild = theleftChild;
        rightChild = therightChild;
    }

    // node visit method
    public static void visit(BinaryTreeNode t)
        {System.out.print(t.element + " ");}
   
    // preorder traversal
     public static void preOrder(BinaryTreeNode t)
     {
         if (t != null)
         {
            visit(t); //visit current node
            preOrder(t.leftChild); // left subtree
            preOrder(t.rightChild); // right subtree
         }      
     }

     // preorder traversal
     public static void inOrder(BinaryTreeNode t)
     {
         if (t != null)
         {
            inOrder(t.leftChild); // left subtree
            visit(t); //visit current node
            inOrder(t.rightChild); // right subtree
         }
     }

     public static void posOrder(BinaryTreeNode t)
     {
         if (t != null)
         {
            posOrder(t.leftChild); // left subtree
            posOrder(t.rightChild); // right subtree
            visit(t); //visit current node
         }
     }
}


package javaappbtree;
/**
 * @author José Braga de Vasconcelos
 */
public interface BinaryTree {
    public boolean isEmpty();
    public BinaryTreeNode insertBST(BinaryTreeNode node);
    public void attachLeft(BinaryTreeNode node, BinaryTreeNode left);
    public void attachRight(BinaryTreeNode node, BinaryTreeNode right);
    public BinaryTree removeLeft();
    public BinaryTree removeRight();
}


this is what i have so far