难度:简单
给定二叉搜索树的根结点
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
互不相同
分析:
遍历就行,因为是二叉搜索树,左小右大,所以在左小于low和右大于high的时候,舍弃无用的一部分。
代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int rangeSumBST(TreeNode root, int low, int high) {
if (root == null)
return 0;
//root.val大于high时,返回左子树范围和
if (root.val > high) {
return rangeSumBST(root.left, low, high);
}
//root.val小于low时,返回右子树范围和
if (root.val < low) {
return rangeSumBST(root.right, low, high);
}
//在[low,high]范围内时
return root.val + rangeSumBST(root.left, low, high) + rangeSumBST(root.right, low, high);
}
}