Leetcode-938.二叉搜索树的范围和
给定二叉搜索树的根结点 root,返回 L 和 R(含)之间的所有结点的值的和。
二叉搜索树保证具有唯一的值。
示例 1:
输入:root = [10,5,15,3,7,null,18], L = 7, R = 15
输出:32
示例 2:
输入:root = [10,5,15,3,7,13,18,1,null,6], L = 6, R = 10
输出:23
提示:
树中的结点数量最多为 10000 个。
最终的答案保证小于 2^31。
思路:
递归遍历树的结点,并判断结点中的值是否在规定区间,若在则相加。
C++代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void calSum(TreeNode* root, int L, int R, int& sum){
if(root == NULL)
return;
if(root->val >= L && root->val <=R){
sum += root->val;
}
if(L <= root->val)
calSum(root->left, L, R, sum);
if(R >= root->val)
calSum(root->right, L, R, sum);
}
int rangeSumBST(TreeNode* root, int L, int R) {
int sum = 0;
calSum(root, L, R, sum);
return sum;
}
};
python代码:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def rangeSumBST(self, root: TreeNode, L: int, R: int) -> int:
if root == None:
return 0
numsSum = 0
if L <= root.val <= R:
numsSum += root.val
if L <= root.val:
numsSum += self.rangeSumBST(root.left, L, R)
if R >= root.val:
numsSum += self.rangeSumBST(root.right, L, R)
return numsSum