BinarySearchTreeAngka.java

public class MasukinNama{


public static void main(String[] args){
   
        BinarySearchTreeNama masukan = new BinarySearchTreeNama();
       
        char ubahstring[] ;
       
        System.out.print(" Masukkan kata atau nama : ");
        Scanner in = new Scanner(System.in);
        String input = in.nextLine();
        System.out.println();
       
        ubahstring = input.toCharArray();
       
        for(int x = 0; x<ubahstring.length; x++){
            masukan.insert(ubahstring[x]);
        }

yg selanjutnya samaain kayak in order , postordernya , preorder nya