YudhaHendrawanS.D

public class BinarySearchTreeString {     NodeString root;     public BinarySearchTreeString() {         root = null;     }     public void insert(String key) {         root = insertRec(root, key);     }     private NodeString insertRec(NodeString root, String key) {         if (root == null) {             root = new NodeString(key);             return root;         }         if (key.compareTo(key) < root.key.compareTo(key)) {             root.left = insertRec(root.left, key);         } else if (key.compareTo(key) > root.key...

public class BinarySearchTreeAngka {         NodeAngka root;                 public BinarySearchTreeAngka(){                     root = null;             }                 public void insert (int key){                     root = insertRec (root, key);         }                 private NodeAngka insertRec(NodeAngka root, int key){                 if(root == null){       ...

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(uba...

public class BinarySearchTreeNama{                     NodeNama root;                 public BinarySearchTreeNama(){                     root = null;             }                 public void insert (char key){                     root = insertRec (root, key);         }                 private NodeNama insertRec(NodeNama root, char key){                 if(ro...

public class NodeNama {         char key;     NodeNama left, right;         public NodeNama(char item){             key = item;         left = right = null;     } }