Tree: Preorder Traversal

  • + 0 comments
    
    

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

    
    

    solve(root);