JAVA: Binary Search Tree help!! 10 pts best answer !!!?

Question

//class1:
public class BSTNode1 {
public Object data;
public BSTNode1 left, right;
public Object key;


public BSTNode1 (Object d, BSTNode1 l, BSTNode1 r, Object key)
{
data=d;
left=l;
right=r;
this.key=key;

}

public BSTNode1(Object d){

data=d;
left = null;
right =null;
}

//left right set null


}





//class2:


import java.util.Comparator;





public class BST3{
private BSTNode3 root;

private Comparator

Answer 1

Like Walter said, the stack trace tells you what is going wrong...you are using recursion but you have the termination condition wrong, you just turtle all the way down (until you run out of stack space).



This jumped out at me:



The insert function takes a BSTNode3 node parameter.



But what is the *very first* thing insert does? This:

node=root;



So, you pass insert a node, but you immediately ignore that value and replace it with root. That sounds like a good recipe for infinite recursion to me. I don't know if just commenting out that 1 line will fix everything, but it's a start. Whatever you do...DON'T PUT IT BACK IN if something else goes wrong.

Answer 2

Why dont you mark the lines where you are getting error.

I am sure I have supplied a version of working code recently which successfully inserted nodes into BST.

Answer 3

You must not be checking it properly. Your error shows that you are going in recursion too deep which shouldn't be happening. I may look at it if you paste your code here: http://pastebin.com/ I do not want to read this code in YA because the formatting is not right. Make sure you select Java as the language.