zoukankan      html  css  js  c++  java
  • LeetCode 938. Range Sum of BST

    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);
            }
               
                
        }
    };
  • 相关阅读:
    SUM游戏
    指针入门(四)
    MSP430 G2553 寄存器列表与引脚功能
    MSP430G2553头文件解析
    修复Kaos的中文显示
    VIM使用技巧3
    VIM使用技巧2
    Java学习之路(3)
    指针入门(三)
    共享VIM配置文件
  • 原文地址:https://www.cnblogs.com/douzujun/p/10888932.html
Copyright © 2011-2022 走看看