938. Range Sum of BST

最新推荐文章于 2020-03-27 11:10:01 发布

SnailRunFast

最新推荐文章于 2020-03-27 11:10:01 发布

阅读量227

点赞数

分类专栏： Leet Code

本文链接：https://blog.csdn.net/snailrunfast/article/details/83959374

版权

Leet Code 专栏收录该内容

143 篇文章 0 订阅

订阅专栏

938. Range Sum of BST

Medium

Given the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive).

The binary search tree is guaranteed to have unique values.

Example 1:

Input: root = [10,5,15,3,7,null,18], L = 7, R = 15
Output: 32

Example 2:

Input: root = [10,5,15,3,7,13,18,1,null,6], L = 6, R = 10
Output: 23

Note:

The number of nodes in the tree is at most 10000.
The final answer is guaranteed to be less than 2^31.

/**
 * 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 (null == root) {
            return 0;
        }
        
        if (root.val >= L && root.val <= R) {
            return root.val 
                + rangeSumBST(root.left, L, R) + rangeSumBST(root.right, L, R);
        }
        
        return rangeSumBST(root.left, L, R) + rangeSumBST(root.right, L, R);
    }
}