Daily LeetCoding Challenge (14 December 2021)
Solution in c++\n\n\n\nclass Solution {\npublic:\n    int rangeSumBST(TreeNode* root, int low, int high) {\n        \n        if(!root) return 0;\n        int s
**Solution in c++**\n\n```\n\nclass Solution {\npublic:\n    int rangeSumBST(TreeNode* root, int low, int high) {\n        \n        if(!root) return 0;\n        int sum = 0;\n        if(root->val >= low && root->val <= high) sum += root->val;\n        return sum + rangeSumBST(root->left, low, high) + rangeSumBST(root->right, low, high);\n\n    }\n};\n```\n**if you understand solution then dont forget to upvote**
['Binary Search Tree', 'C']