Leetcode-Solutions/975-range-sum-of-bst.cpp at main · aghersidev/Leetcode-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
/**
 * 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) {
        int sum = 0;
        stack<TreeNode*> sNodes;
        vector<int> list;
        sNodes.push(root);
        while (!sNodes.empty()) {
            TreeNode* n = sNodes.top();
            sNodes.pop();
            if (n) {
                if (n->val >= low && n->val <= high) sum += (n->val);
                    sNodes.push(n->left);
                    sNodes.push(n->right);

            }
        }
        return sum;
    }
};