Könnte mir jemand meine Fehler verbessern ?
Code:
public void empty(){
root == null;
}
public boolean isEmpty(){
return root == null;
public key(int elem){
key = elem;
links = null;
rechts = null;
}
public boolean son(int elem)
{
return search(elem, root)
}
private boolean serach(int elem, key t){
if (k == null) return fals;
if (k.date == elem)
return tree;
if (k.data > elem) return search(elem k.links);
if (k.date< elem) return search(elem k.recht);
}