mirror of
https://github.com/TheAlgorithms/C
synced 2025-04-22 05:06:12 +03:00
d9b9bbd4f5
The for loop utilized in 283 was improperly structured as 'start' was no declared as the value to index. Also, make the other cases more readable. Signed-off-by: RJ Trujillo <certifiedblyndguy@gmail.com>
10 lines
338 B
C
10 lines
338 B
C
int rangeSumBST(struct TreeNode* root, int L, int R){
|
|
if (root == NULL) {
|
|
return 0;
|
|
} else if (root->val >= L && root->val <= R) {
|
|
return root->val + rangeSumBST(root->left, L, R) + rangeSumBST(root->right, L, R);
|
|
} else {
|
|
return rangeSumBST(root->left, L, R) + rangeSumBST(root->right, L, R);
|
|
}
|
|
}
|