@@ -0,0 +1,293 @@
+/* you only have to complete the function given below.%0ANode is defined as%0A%0Aclass Node %7B%0A    int data;%0A    Node left;%0A    Node right;%0A%7D%0A%0A*/%0A%0Avoid Preorder(Node root) %7B%0A    if (root == null) %7B return; %7D%0A    System.out.print(root.data + %22 %22);%0A    Preorder(root.left);%0A    Preorder(root.right);%0A%7D%0A

solve tree preorder