Tree: Preorder Traversal

  • + 0 comments

    My solution in C++

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