Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

二叉搜索树的范围和 #1042

Open
pwstrick opened this issue Jul 9, 2020 · 0 comments
Open

二叉搜索树的范围和 #1042

pwstrick opened this issue Jul 9, 2020 · 0 comments
Labels
Leetcode Leetcode的题目

Comments

@pwstrick
Copy link
Owner

pwstrick commented Jul 9, 2020

938. 二叉搜索树的范围和

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @param {number} L
 * @param {number} R
 * @return {number}
 */
var sum;
var rangeSumBST = function(root, L, R) {
    sum = 0;
    dfs(root, L, R);
    return sum;
};
function dfs(root, L, R) {
    if(root == null) {
        return;
    }
    if(root.val >= L && root.val <= R) {
		sum += root.val;
    }
	dfs(root.left, L, R);
	dfs(root.right, L, R);
}
@pwstrick pwstrick added the Leetcode Leetcode的题目 label Jul 9, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Leetcode Leetcode的题目
Projects
None yet
Development

No branches or pull requests

1 participant