目录链接:
力扣编程题-解法汇总_分享+记录-CSDN博客
GitHub同步刷题项目:
https://github.com/September26/java-algorithms
原题链接:. - 力扣(LeetCode)
描述:
给定二叉搜索树的根结点 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
提示:
- 树中节点数目在范围
[1, 2 * 104]
内 1 <= Node.val <= 105
1 <= low <= high <= 105
- 所有
Node.val
互不相同
解题思路:
进行二叉树搜索遍历,如果值在范围内,则累加到sum上。
这里有一个节省时间的办法,如果某个节点值>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 rangeSumBST(TreeNode *root, int low, int high)
{
int sum = 0;
searchTreeNode(root, sum, low, high);
return sum;
}
void searchTreeNode(TreeNode *root, int &sum, int low, int high)
{
if (root == nullptr)
{
return;
}
if (root->val > high)
{
searchTreeNode(root->left, sum, low, high);
}
else if (root->val < low)
{
searchTreeNode(root->right, sum, low, high);
}
else
{
sum += root->val;
searchTreeNode(root->left, sum, low, high);
searchTreeNode(root->right, sum, low, high);
}
}
};