Binary Search Tree Problem

How would I clone a Linked list que?

DO YOUR OWN HOMEWORK!!!!!!!!!!!!!!!!!!!!!!

Yes.

You may want to take a look at this link. It will give you some assistance in restating your question in a way which will be more likely to elicit a more helpful response.

It is not homework, It is an interest. Anyway, Could someone tell me if this is the right algorithm for a search in the Binary Search Tree algorithm?

abstract class BST {

public int data;
public BST left;
public BST right;
static public BST find(BST root, int value);

}


public class findBST extends BST {

static public BST find(BST root, int value)
{
if (root == null)
return null;

if (value < root)
return find(left, value);
else if (value > root)
return find(right, value);
else
return root;

}

}

anyone know?

Binary Search Trees are a very very well known algorithm.

Here's one site i found mcgill University
Google returned back 17.3 million hits on Binary Search Tree.

Compare your algorithm with those and see what you come up with.

As a side note, i though this was pretty cool Graphical Binary Search Tree

I have spent atleast a couple hours looking for a search algorithm for the binary search tree. I cannot seem to find one, that is why I am asking here. I figure someone here must know, . Anyone help PLEASE?

Why did you spend a couple of hours looking? The link i posted has the algorithem.

I spent acouple of hours looking when I first needed the algorithm. But the link you posted has a algorithm and its not recursive. The search algorithm they use is:

TreeSearch (x, k)

while x != NIL and k != key[x]
if k < key[x]: x <- left[x]
if k > key[x]: x <- right[x]
return x

Would my algorithm return the same result? (I am not sure, =/)

Have you tried your algorithm yet? If not, what's stopping you. It seems the easiest way to see if it works is to try it.

Well, that would mean making the entire Binary Search Tree algorithm, which is pretty big. The easiest way would be to find someone who knows this algorithm, and he could just read my 5 lines and tell me if it works or not . Does anyone know?

...

If you don't plan on implementing the rest of the tree, why are you trying to write the search?

Because I am using the search algorithm from the binary search tree, but it is more like a hybrid algorithm used for something else. Does anyone know if my 5 lines are correct or not? =/, I never though it would be this hard to find a simple answer. The reason I want to be so certain is because I dont want to have debugging issues down the road.

Then why not test it with your something else that you do plan on implementing


Debugging is a part of programming. Writing your own test code goes a long way in terms of simplifying debugging. It's how i'd test your code. So i I'm a little curious why I, or someone else should i spend the time writing that code, to test your function? This is a very important skill that you might as well learn now, so you'll be equipped with the knowledge to test the next thing you write. You came up with your initial algorithm, so why not try coming up with something that tests it?

I have plenty experience in the debugging department, I just did not want a cascading debugging problem like I have said before. I have also said that it would be easier for someone who knows the algorithm to take alook at my 5 lines of code, and tell me if it would work with a standard binary search algorithm. So if anyone could do this for me, I would be very grateful. Obviously tfecw cannot answer my question. I am asking this question to someone who knows the binary search algorithm. Thanks.