题目链接https://leetcode-cn.com/problems/range-sum-of-bst/
解题代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int rangeSumBST(TreeNode* root, int low, int high) {
if(root==NULL){
return 0;
}
int sum = 0;
traversal(root, sum, low, high);
return sum;
}
void traversal(TreeNode* root, int& sum, int low, int high){
if(root==NULL){
return;
}
if(root->val < low){
traversal(root->right, sum, low, high);
}else if(root->val > high){
traversal(root->left, sum, low, high);
}else{
sum += root->val;
traversal(root->left, sum, low, high);
traversal(root->right, sum, low, high);
}
}
};
运行结果