C++ - Inorder traversal
\n/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeNode *right;\n *     TreeNode(int x) : v
```\n/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeNode *right;\n *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}\n * };\n */\nclass Solution {\npublic:\n    int sum = 0;\n    \n    void inorder(TreeNode* root, int L, int R){\n        if(root->left)inorder(root->left, L, R);\n        if(root->val>=L && root->val<=R)sum+=root->val;\n        if(root->right)inorder(root->right, L, R);\n    }\n    int rangeSumBST(TreeNode* root, int L, int R) {\n        \n        //SOLUCHAN STARTS HERE - DUN DUN DUN DUN \n        inorder(root, L, R);\n        return sum;\n    }\n};\n\n```
['Recursion', 'C']