diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/range_sum_bst.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/range_sum_bst.cpp')
-rw-r--r-- | other/range_sum_bst.cpp | 22 |
1 files changed, 0 insertions, 22 deletions
diff --git a/other/range_sum_bst.cpp b/other/range_sum_bst.cpp deleted file mode 100644 index 046aee2..0000000 --- a/other/range_sum_bst.cpp +++ /dev/null @@ -1,22 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int rangeSumBST(TreeNode *root, int low, int high) { - queue<TreeNode *> q; - q.push(root); - int sum = 0, v; - while (q.size()) { - root = q.front(); - q.pop(); - v = root->val; - if (v >= low && v <= high) - sum += v; - if (v > low && root->left) - q.push(root->left); - if (v < high && root->right) - q.push(root->right); - } - return sum; - } -}; |