/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int rangeSumBST(TreeNode root, int L, int R) {
if(root==null)
return 0;
int sum = 0;
int sumL = 0;
int sumR = 0;
if(root.val>=L && root.val<=R)
sum = root.val;
if(root.val>=L)
sumL = rangeSumBST(root.left, L, R);
if(root.val<=R)
sumR = rangeSumBST(root.right, L, R);
return sum+sumL+sumR;
}
}