typedef struct TreeNode Node;
void getSum(Node *node, int *sum, int L, int R){
if(!node) return;
getSum(node->left, sum, L, R);
getSum(node->right, sum, L, R);
*sum += ((node->val >= L &&node->val <= R) ? node->val : 0) ;
}
int rangeSumBST(struct TreeNode* root, int L, int R){
int sum = 0;
getSum(root, &sum, L, R);
return sum;
}
LeetCode-938-二叉搜索树的范围和-C语言
最新推荐文章于 2021-05-23 02:41:23 发布