LeetCode #938. Range Sum of BST

最新推荐文章于 2024-06-06 19:39:31 发布

原创最新推荐文章于 2024-06-06 19:39:31 发布 · 132 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

625 篇文章

订阅专栏

本文介绍了一种算法，用于解决二叉搜索树中特定区间内节点值的求和问题。通过深度优先搜索（DFS），该算法遍历树结构，高效地计算出指定范围内的节点总和。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述：

Given the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive).

The binary search tree is guaranteed to have unique values.

Example 1:

Input: root = [10,5,15,3,7,null,18], L = 7, R = 15
Output: 32

Example 2:

Input: root = [10,5,15,3,7,13,18,1,null,6], L = 6, R = 10
Output: 23

Note:

The number of nodes in the tree is at most 10000.
The final answer is guaranteed to be less than 2^31.

class Solution {
public:
    int rangeSumBST(TreeNode* root, int L, int R) {
        int sum=0;
        DFS(root,L,R,sum);
        return sum;
    }
    
    void DFS(TreeNode* root, int L, int R, int& sum)
    {
        if(root==NULL) return;        
        if(root->val<=R&&root->val>=L) sum+=root->val;
        if(L<root->val) DFS(root->left,L,R,sum);
        if(root->val<R) DFS(root->right,L,R,sum);
    }
};