Binary Search Method

[Remaan Rem]

Hi all,

I am trying to write a method: which does the following :
1. traverse the BST looking for a certain element of type T .
2. if found its value get changed with another one.
3. if not, even after completing all the traversal, we add the element to the place we stopped in :
So this is the code I have :

public TreeNode<T> setInsert( TreeNode <T> Root , T value){
		
	int compResult = value.compareTo(Root.data);
	TreeNode <T> newNode = new TreeNode<T>(value,null,null);
	// we first check if the root is null, we add the element to the data of the root.	
	if	( Root == null) Root = newNode;
		 
	// Test different cases for greater than/ less than/ equal to: the given data 
	else if (compResult == 0) { 	
		Root.data = value;
				
		}
	
	else if ( compResult < 0){
		Root.leftChild = setInsert (Root.leftChild, value);
	}
		
	else if ( compResult > 0 ) 
		Root.rightChild = setInsert (Root.rightChild , value);
	
//	else 
//		throw new DuplicateItemException( x.toString( ) );
	 return Root;
		 
		
	}

The basic question : is that am not very sure about the recursive call that comes under the second and the third if statments.

Does it really add the element in the specified location.

??

[marc weber]

Remaan Rem wrote:...am not very sure about the recursive call that comes under the second and the third if statments.

Does it really add the element in the specified location.

??

Can you think of a way to test this?

[Remaan Rem]

maybe call it from another class, ir the same class.
and adding print statement? inside of the method