-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathRangeSumOfBST.java
More file actions
39 lines (38 loc) · 1.18 KB
/
RangeSumOfBST.java
File metadata and controls
39 lines (38 loc) · 1.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/**
* LeetCode 938 https://leetcode.com/problems/range-sum-of-bst/
*
*/
/**
* 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;
* }
* }
*/
class Solution {
public int rangeSumBST(TreeNode root, int low, int high) {
int result = 0;
if (root == null) {
return result;
} else if (root.val < low) {
result = rangeSumBST(root.right, low, high);
} else if (root.val == low) {
result = root.val + rangeSumBST(root.right, low, high);
} else if (root.val > low && root. val < high) {
result = rangeSumBST(root.left, low, high) + root.val + rangeSumBST(root.right, low, high);
} else if (root.val == high) {
result = rangeSumBST(root.left, low, high) + root.val;
} else if (root.val > high) {
result = rangeSumBST(root.left, low, high);
}
return result;
}
}