Java

Java RSS

Binary Search Tree

Please support our Java advertiser: Programming Forums - DaniWeb Sister Site

•

Join Date: Nov 2008

Posts: 332

Reputation: quuba is on a distinguished road

Solved Threads: 53

quuba

Offline

Posting Whiz

Re: Binary Search Tree

#11

Dec 17th, 2008

once more - Use NetBeans to develop your program!
text throw new UnsupportedOperationException("Not supported yet."); - replace this lines with own code.
There should be invocations of your private methods with same name (sometime you need make some adaptation).
Use NetBeans , proper tool for this advanced java program. NetBeans helps you in develop.

•

Join Date: May 2007

Posts: 4,479

Reputation: Ezzaral has much to be proud of

Solved Threads: 514

Ezzaral

Offline

Industrious Poster

Re: Binary Search Tree

#12

Dec 17th, 2008

Deven, you really need to use [code] [/code] tags around any code that you post. Putting it in as a quote does nothing to preserve it's formatting.

•

Join Date: Nov 2008

Posts: 332

Reputation: quuba is on a distinguished road

Solved Threads: 53

quuba

Offline

Posting Whiz

Re: Binary Search Tree

#13

Dec 17th, 2008

meantime relate to #10

 Help with Code Tags 
 java Syntax (Toggle Plain Text) 
    @Override
    protected boolean search(Node<E> curr, E key) {
        while (curr != null) {
            if (curr.data.compareTo(key) < 0) {
                curr = curr.left;
                return true;
            } else if (curr.data.compareTo(key) > 0) {
                curr = curr.right;
                return true;
            } else {
                return false;
            }
            //return false;// 1.Not proper position for return
        }
        return false;//2.Correct position for return
    }
    @Override
    protected boolean search(Node<E> curr, E key) {
        while (curr != null) {
            if (curr.data.compareTo(key) < 0) {
                curr = curr.left;
                return true;
            } else if (curr.data.compareTo(key) > 0) {
                curr = curr.right;
                return true;
            } else {
                return false;
            }
            //return false;// 1.Not proper position for return
        }
        return false;//2.Correct position for return
    }

Inside your methods, if you filled them , don't still use
throw new UnsupportedOperationException;

•

Join Date: Nov 2008

Posts: 11

Reputation: deven1974 is an unknown quantity at this point

Solved Threads: 0

deven1974

Offline

Newbie Poster

Re: Binary Search Tree

#14

Dec 18th, 2008

Hello,
I want thank for your guys help with this diffcult program. I finally got the program to work, but I don't know the output is right. Can anybody tell me is this what output should be or something else. Is this output answer the question that is given from the program.

•

public class BinarySearchTree<E extends Comparable<? super E>> extends Tree<E> {
protected Node<E> insert(Node<E> curr, Node<E> node) {
//throw new UnsupportedOperationException;
Node<E> temp= new Node<E>(node.data) ;
if( temp == null )
temp = new Node<E>(curr.data);
else if( (temp.data.compareTo(node.data))<0 )
temp.left = insert( curr.right, node.left );
else if( (temp.data.compareTo(node.data))>0 )
temp.right = insert( node.right, curr.left );

return temp;
}

protected Node<E> remove(Node<E> curr, E data)
{
//throw new UnsupportedOperationException;
Node<E> temp= new Node<E>(curr.data) ;
if( temp == null )
throw new TreeException();
if( temp.data.compareTo( curr.data ) < 0 )
temp.left = remove( temp.left,data );
else if( temp.data.compareTo( curr.data ) >0)
temp.right = remove( temp.right,data );
return temp;

}

protected boolean search(Node<E> curr, E key) {
while (curr != null) {
if (curr.data.compareTo(key) < 0) {
curr = curr.left;
return true;
} else if (curr.data.compareTo(key) > 0) {
curr = curr.right;
return true;
} else {
return false;
}

}
return false;
}
}

Output Result:

•

Microsoft Windows XP [Version 5.1.2600]
(C) Copyright 1985-2001 Microsoft Corp.

C:\Documents and Settings\Deven>cd Desktop

C:\Documents and Settings\Deven\Desktop>cd Project 7

C:\Documents and Settings\Deven\Desktop\Project 7>javac *.java

C:\Documents and Settings\Deven\Desktop\Project 7>java Main
0
8
9
7
5
3
1
1
9
4
0 => true
8 => true
9 => true
7 => true
15 => true
13 => true
11 => true
1 => true
19 => true
14 => true
4
4
4
4
4
4
4
4
4
4

Thanks for your help on this.

•

Join Date: Nov 2008

Posts: 332

Reputation: quuba is on a distinguished road

Solved Threads: 53

quuba

Offline

Posting Whiz

Re: Binary Search Tree

#15

Dec 20th, 2008

check your code:

 Help with Code Tags 
 java Syntax (Toggle Plain Text) 
 
    protected Node<E> insert(Node<E> curr, Node<E> node) {
//throw new UnsupportedOperationException;
        System.out.println(" curr " + curr + " " + ((curr == null) ? "." : "data=" + curr.data));
        System.out.println(" node " + node + " " + ((node == null) ? "." : "data=" + node.data));
        Node<E> temp = new Node<E>(node.data);
        System.out.println(" temp " + temp + " " + ((temp == null) ? "." : "data=" + temp.data));
        if (temp == null) {
            temp = new Node<E>(curr.data);
            System.out.println(" temp == null ");
        } else if ((temp.data.compareTo(node.data)) < 0) {
            System.out.print("L ");
            temp.left = insert(curr.right, node.left);
        } else if ((temp.data.compareTo(node.data)) > 0) {
            System.out.print("R ");
            temp.right = insert(node.right, curr.left);
        }
 
        return temp;
    }
    protected Node<E> insert(Node<E> curr, Node<E> node) {
//throw new UnsupportedOperationException;
        System.out.println(" curr " + curr + " " + ((curr == null) ? "." : "data=" + curr.data));
        System.out.println(" node " + node + " " + ((node == null) ? "." : "data=" + node.data));
        Node<E> temp = new Node<E>(node.data);
        System.out.println(" temp " + temp + " " + ((temp == null) ? "." : "data=" + temp.data));
        if (temp == null) {
            temp = new Node<E>(curr.data);
            System.out.println(" temp == null ");
        } else if ((temp.data.compareTo(node.data)) < 0) {
            System.out.print("L ");
            temp.left = insert(curr.right, node.left);
        } else if ((temp.data.compareTo(node.data)) > 0) {
            System.out.print("R ");
            temp.right = insert(node.right, curr.left);
        }

        return temp;
    }

Result--> always one element inside the tree (last inserted).