Tree Preorder Traversal using Java

/*
Node is defined as

class Node {
    int data;
    Node left;
    Node right;
}
*/

1. void Preorder(Node root) {
2. System.out.print(root.data + " ");
3. 
   
4.     if (root.left != null) {
5.         Preorder(root.left);
6.     } 
7.     
8.     if (root.right != null) {
9.         Preorder(root.right);
10.     }
11. }