Easy Java Solution using Recursion
\n\n\nclass Solution {\n    int sum;\n    public int rangeSumBST(TreeNode root, int low, int high) {\n        sum = 0;\n        rangeSum(root,low,high);\n      
\n\n```\nclass Solution {\n    int sum;\n    public int rangeSumBST(TreeNode root, int low, int high) {\n        sum = 0;\n        rangeSum(root,low,high);\n        return sum;\n        \n    }\n        \n    public void rangeSum(TreeNode root,int low,int high){\n        \n        if(root != null){\n           \n        if(low <= root.val && root.val <= high ){\n            sum +=root.val;\n        }\n        if(low < root.val  )\n            rangeSum(root.left,low,high);\n\n        if(root.val <= high )\n            rangeSum(root.right,low,high);\n        \n        \n    }\n        \n    }\n}\n```\n## \n## Please Upvote if it helped.\n## Thanks
['Binary Search Tree', 'Recursion']