g0901_1000.s0938_range_sum_of_bst.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g0901_1000.s0938_range_sum_of_bst;
// #Easy #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree #Udemy_Tree_Stack_Queue
// #2022_03_30_Time_0_ms_(100.00%)_Space_64.7_MB_(76.99%)
import com_github_leetcode.TreeNode;
/*
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
public class Solution {
public int rangeSumBST(TreeNode root, int low, int high) {
if (root == null) {
return 0;
}
if (root.val <= high && root.val >= low) {
int sum = root.val;
int left = rangeSumBST(root.left, low, high);
int right = rangeSumBST(root.right, low, high);
return sum + left + right;
} else if (root.val < low) {
return rangeSumBST(root.right, low, high);
} else {
return rangeSumBST(root.left, low, high);
}
}
}