Tree: Preorder Traversal

  • + 0 comments

    my C++ Solution

     void preOrder(Node *root) {
            if(root)
            {cout<<root->data<<" ";
            preOrder(root->left);
            preOrder(root->right);
            }
        }