A funny problem ..?

Question

hi every1,
I am trying to create a ADT binary tree. The insert method works in funny way. If i try to add new items by let is say: bst.inesert("a"); .... ("x"); it works fine. Even if i keep a for and next loop and populate it it is okay and searches the item fine too. But the problem is that i have to read data from a file and pupulate the tree. it populates the tree also but when i try to search for the item. it returns null. Where can something go wrong? i search for an item as follow:
     String temp1=new String("as"); //THIS IS IN MY FILE AND READS IT FINE TOO
          if (bst.findNode(temp1)!= null)
               System.out.println("Found " +bst.findNode(temp1).getItem().toString());
          else
               System.out.println("Item " + temp1 + " is not found.");
          System.out.println("Size " + bst.size(bst.root)); //THIS ONE WORKS FINE
my insert method is:
     public void treeInsert(Object newItem) {
TreeNode thisNode = root;
     boolean exitWhile = false;
if ( thisNode == null )
// The tree is empty. Set root to point to a new node
// containing the new item.
root = new TreeNode( newItem);
else
               while (!exitWhile){
                    if (comparator.compare(thisNode.getItem(), newItem) < 0)
                         if (thisNode.getLeft() != null)
                              thisNode = thisNode.getLeft();
                         else{
                              exitWhile = true;
                              thisNode.setLeft(new TreeNode(newItem));
                    else
                         if (thisNode.getRight() != null)
                              thisNode = thisNode.getRight();
                         else{
                              exitWhile = true;
                              thisNode.setRight(new TreeNode(newItem));
}

Answer 1

You had a problem with your search method but you seem to have accidentally posted the code of your insert method instead.