Notes

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class SDALab3 {

public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String input;
BinaryTree tree = new BinaryTree();
while ((input = br.readLine()) != null && input.length() != 0) {

StringTokenizer tk = new StringTokenizer(input, " ");
String command = tk.nextToken();

if (command.equalsIgnoreCase("PUT")) {
String nama = tk.nextToken();
int ukuran = Integer.parseInt(tk.nextToken());
tree.insert(new Barang(nama, ukuran));

} else if (command.equalsIgnoreCase("SHOWALL")) {
tree.print(tree.getRoot());
} else if(command.equalsIgnoreCase("GET")){
System.out.println(tree.findBarang(tree.getRoot(), tk.nextToken()).getBarang().toString());
}

}
}

}

class Barang implements Comparable<Barang> {
String namaBarang;
int ukuran;


public Barang(String namaBarang, int ukuran) {
this.namaBarang = namaBarang;
this.ukuran = ukuran;
}

public String getNamaBarang() {
return namaBarang;
}

public int getUkuran() {
return ukuran;
}

@Override
public int compareTo(Barang o) {
if (this.getUkuran() < o.getUkuran())
return -1;
else if (this.getUkuran() > o.getUkuran())
return 1;
else
return 0;
}

public String toString() {
return this.namaBarang + " " + this.ukuran;
}

}

class BinaryTree {
private BinaryNode root;
int counter;

public BinaryTree() {
root = null;
}

public BinaryNode getRoot() {
return this.root;
}

public boolean isEmpty() {
return root == null;
}


public int getCounter() {
return counter;
}

public void insert(Barang b) {
root = insert(root, b);
}

private BinaryNode insert(BinaryNode node, Barang b) {
if (node == null) {
node = new BinaryNode(b, null, null);
counter++;
} else {
if (b.compareTo(node.getBarang()) < 0) {
node.left = insert(node.left, b);
counter++;
} else if (b.compareTo(node.getBarang()) > 0) {
node.right = insert(node.right, b);
counter++;
} else
System.out.println(b.getNamaBarang() + " gagal masuk");
}
return node;
}



public BinaryNode findBarang(BinaryNode node, String nama){
boolean isFound = false;
if(node != null){
if(node.getBarang().getNamaBarang().equals(nama)){
isFound = true;
return node;
} else {
BinaryNode nodeFound = findBarang(node.left, nama);
if(nodeFound==null){
nodeFound = findBarang(node.right, nama);
}
return nodeFound;
}
} else {

return null;
}


}






public void print(BinaryNode node) {
if (node != null) {
print(node.left);
System.out.println(node.getBarang().toString());
print(node.right);
} else if(root == null) System.out.println("kososng");
}

}

class BinaryNode {
Barang b;
BinaryNode left;
BinaryNode right;

public BinaryNode(Barang b, BinaryNode left, BinaryNode right) {
this.b = b;
this.left = left;
this.right = right;
}

public Barang getBarang() {
return this.b;
}
}