Arbol binario

Arbol binario .java
import java.io.*;
public class Arbol {
public static int menu() throws IOException {
BufferedReader entrada = new BufferedReader(new InputStreamReader(System.in));int x;
System.out.println("");
do {
System.out.println("MENU");
System.out.println("1. Introducir elementos al arbol");System.out.println("2. Eliminar elementos de arbol");
System.out.println("3. Recorrer en preorden");
System.out.println("4. Recorrer en inorden");
System.out.println("5.Recorrer en postorden");
System.out.println("6. Salir");
System.out.println("De su opcion=>");
String cad = entrada.readLine();
x =Integer.parseInt(cad);
} while (x < 1 || x > 6);
return x;
}

public static void main(String[] arg) throws IOException {

int x;
CNodo p = null;
do {x = menu();
switch (x) {
case 1:
p = introduce(p);
break;
case 2:
p=Elimina(p);
break;
case 3:
preorden(p);
break;
case 4:
inorden(p);break;
case 5:
posorden(p);
break;
default:
System.out.println("CAMARA");
break;}
} while (x < 6);
}

public static CNodo introduce(CNodo r) throws IOException {
BufferedReader entrada = new BufferedReader(newInputStreamReader(System.in));
CNodo aux,aux1=null,q=null;
aux=new CNodo();
System.out.print("Da el elemento a introducir=> ");
String car = entrada.readLine();
aux.dato =...