首页 > 其他 > 详细

LeetCode 938. Range Sum of BST

时间:2019-05-19 13:54:00      阅读:113      评论:0      收藏:0      [点我收藏+]

 

938. Range Sum of BST

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

题意:

技术分享图片

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int rangeSumBST(TreeNode* root, int L, int R) {
        if (root == nullptr) 
            return 0;
        else if (root->val > R)
        {
            return rangeSumBST(root->left, L, R);
        }
        else if (root->val < L)
        {
            return rangeSumBST(root->right, L, R);
        }
        else
        {
            return root->val + rangeSumBST(root->left, L, root->val) + rangeSumBST(root->right, root->val, R);
        }
           
            
    }
};

 

LeetCode 938. Range Sum of BST

原文:https://www.cnblogs.com/douzujun/p/10888932.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!