i have a binary search tree data structure with C.

typedef root *bst;
struct {
int item;
bst left;
bst right;
} bst;

but how to declare a binary search tree in java, since java doesn't have pointer.

i am a beginner in java. any answer would be approciate.

Its still very easy to do in java. You will need to write two methods.. a compair function and the binary tree.

====Compair=====

public class pInteger implements pComparable{
int i;

public pInteger(){
}
public pInteger(int j){
set(j);
}
public int get(){
return i;
}
public void set(int j){
i = j;
}
public String toString(){
return ""+get();
}
public int compareTo(Object o){
if(o instanceof pInteger)
if(get() > ((pInteger)o).get())
return 1;
else if(get() < ((pInteger)o).get())
return -1;
return 0;
}
}

=====Binary Tree===============

import pComparable;

public class pBinarySearchTree{

public pBinarySearchTree(){
super();
}

public pBinarySearchTree(Object o){
super(o);
}

public void print(){
print(2);
}

public void insert(pComparable o){
pTwoChildNode t,q;
for(q = null, t = getRoot();
t != null && o.compareTo(t.getData()) != 0;
q = t,t = o.compareTo(t.getData()) < 0
? t.getLeft():t.getRight());
if(t != null)
return;
else if(q == null)
setRoot(new pTwoChildNode(o));
else if(o.compareTo(q.getData()) < 0)
insertLeft(q,o);
else
insertRight(q,o);
}
}

THis should give you a good start.