GFG PTOD | 07 Feb | Inorder Traversal | Easy level | Tree

void trverse(Node* root, vector<int> &res) {
        if(!root) return;
        trverse(root->left, res);
        res.push_back(root->data);
        trverse(root->right, res);
    }
    // Function to return a list containing the inorder traversal of the tree.
    vector<int> inOrder(Node* root) {
        // Your code here
        vector<int> res;
        trverse(root, res);
        return res;
    }