mfocko/LeetCode
1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-09-19 17:56:55 +02:00
Code Issues Projects Releases Wiki Activity

cpp: add “938. Range Sum of BST”

Browse source 
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2024-01-08 11:50:46 +01:00
parent 20632b1d7c
commit 30202920b0
Signed by: mfocko
GPG key ID: 7C47D46246790496
1 changed files with 28 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
cpp/range-sum-of-bst.cpp Normal file
View file

@ -0,0 +1,28 @@
/**
* 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) {
if (root == nullptr) {
return 0;
}
int currentValue = 0;
if (low <= root->val && root->val <= high) {
currentValue = root->val;
}
return (currentValue + rangeSumBST(root->left, low, high) +
rangeSumBST(root->right, low, high));
}
};