Skip to content

Files

Latest commit

f84330b · Jun 3, 2023

History

History
50 lines (39 loc) · 933 Bytes

File metadata and controls

50 lines (39 loc) · 933 Bytes

Inorder Traversal Practice

Recursive Method

vector<int> v;
    vector<int> inorderTraversal(TreeNode* root) {
        if(root==NULL)
            return v;

        v=inorderTraversal(root->left);
        v.push_back(root->val);
        v=inorderTraversal(root->right);
        return v;
    }
    

Iterative Method

 vector<int> inOrder(Node* root) {
    vector<int> v;
     Node* node=root;
    stack<Node*> s;
    
    while(true)
    {
        if(node!=NULL)
        {
            s.push(node);
            node=node->left;
        }
        else
        {
            if(s.empty())
               break;
           node=s.top(); 
            s.pop();
           v.push_back(node->data);
           node=node->right;
        }
    }
    return v;
   }
   ```