package treepckg;
public class Node {
Node left;
Node right;
int value;
public Node (int value) {
this.value=value;
}
public void run (){
Node root = new Node(4);
System.out.println("contoh binary tree");
System.out.println("membangun tree dengan nilai akar"+ root.value);
insert (root, 1);
insert (root, 8);
insert (root, 6);
insert (root, 3);
insert (root, 9);
System.out.println("travesing tree secara preorder");
printpreOrder(root);
System.out.println("travesing tree secara in order");
printInOrder(root);
System.out.println("travesing tree secara postorder");
printpostOrder(root);
}
public void insert (Node node, int value) {
if (value <node.value){
if (node.left != null){
insert (node.left, value);}
else{
System.out.println("menyisipkan "+ value+" ke kiri dari "+node.value);
node.left = new Node (value);}}
else if (value>node.value){
if (node.right !=null){
insert(node.right, value);}
else{
System.out.println("menyisipkan "+ value +" ke kanan dari "+node.value);
node.right = new Node(value);}
} }
public void printInOrder(Node node){
if (node != null){
printInOrder(node.left);
System.out.println("Travesed "+node.value);
printInOrder(node.right);
}
}
public void printpostOrder(Node node){
if ( node != null ){
printpostOrder(node.left);
printpostOrder(node.right);
System.out.println("Travesed "+node.value);
}
}
public void printpreOrder(Node node){
if ( node != null ){
System.out.println("Travesed "+node.value);
printpreOrder(node.left);
printpreOrder(node.right);
}
}}
class main {
public static void main (String[]args){
Node test= new Node (5);
test.run();
}
}