leetcode-algorithms/src/RangeSumOfBST.java at master · anishLearnsToCode/leetcode-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
public class RangeSumOfBST {
    public int rangeSumBST(TreeNode root, int low, int high) {
        if (root == null) return 0;
        if (low <= root.val && root.val <= high) {
            return root.val + rangeSumBST(root.left, low, high) + rangeSumBST(root.right, low, high);
        }
        if (root.val < low) return rangeSumBST(root.right, low, high);
        return rangeSumBST(root.left, low, high);
    }
}