Binary Tree Inorder Traversal.cpp

class Solution {
public:
    vector<int>result;

    void inorder(TreeNode* root) {
       if(root!=NULL)
       {
       inorder(root->left);
       result.push_back(root->val);
       inorder(root->right);
       }
    }

    vector<int> inorderTraversal(TreeNode* root) {
        inorder(root);
        return result;  
    }
};