source code tree java post order

package treepckg;

/**
*
* @author dell
*/
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.print("contohnya Binary Tree");
System.out.print("Membangun tree dengan nilai akar"+root.value);
insert (root,1);
insert (root,8);
insert (root,6);
insert (root,3);
insert (root,9);
System.out.print("trasversing tree secara in order"+"\n");
printInOrder(root);
}
public void insert(Node node, int value){
if (valuenode.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.right);
System.out.println("Traversed "+node.value);
printInOrder(node.left);
}
}
}

package treepckg;

/**
*
* @author dell
*/
public class Main {

public static void main(String[] args) {
Node test=new Node(5);
test.run();
}


}