给定二叉搜索树的根结点 root,返回值位于范围 [low, high] 之间的所有结点的值的和。
示例 1:
输入:root = [10,5,15,3,7,null,18], low = 7, high = 15
输出:32
示例 2:
输入:root = [10,5,15,3,7,13,18,1,null,6], low = 6, high = 10
输出:23
分析:中序遍历,把low到high之间的直接加起来。
/**
* 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 flag=0;
int sum=0;
void mid(TreeNode* root,int low,int high)
{
if(root==NULL) return ;
mid(root->left,low,high);
if(root->val==low) flag=1;
if(flag==1) sum+=root->val;
if(root->val==high) flag=0;
mid(root->right,low,high);
}
int rangeSumBST(TreeNode* root, int low, int high) {
mid(root,low,high);
return sum;
}
};