For this Question: Write a function that creates a binary tree similar to given figure:NonePreorder traversal of the binary treeInput: None

Output: 

1 2 5 6 3, I have written this Solution Code:  public static void main(String[] args) {
 Node root = new Node(1);
 root.left = new Node(2);
 root.right = new Node(3);
 root.left.left = new Node(5);
 root.left.right = new Node(6);

 // print out the values of the nodes
        System.out.print(root.value+ " ");
       System.out.print(root.left.value+ " ");
       System.out.print(root.left.left.value+ " ");
       System.out.print(root.left.right.value+ " ");
       System.out.print(root.right.value+ " ");
    }
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not?