Tree: Preorder Traversal

  • + 0 comments

    Java 8 solution :- Recursive Approach

    public static void preOrder(Node root) {
            if(root == null){
                return;
            }
            System.out.print(root.data+" ");
            preOrder(root.left);
            preOrder(root.right);
        }