题目考察的知识点:二叉树
题目解答方法的文字分析:遍历这棵树,然后判断是否满足条件,满足则相加。
本题解析所用的编程语言:c++
/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * }; */ class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param root TreeNode类 * @param low int整型 * @param high int整型 * @return int整型 */ void inorder(TreeNode* root, int low, int high, int& sum) { if (root == nullptr) return; if (root->val >= low && root->val <= high) sum += root->val; inorder(root->left, low, high, sum); inorder(root->right, low, high, sum); } int rangeSumBST(TreeNode* root, int low, int high) { // write code here int sum = 0; inorder(root, low, high, sum); return sum; } };