-
Notifications
You must be signed in to change notification settings - Fork 31
/
938.java
33 lines (30 loc) · 850 Bytes
/
938.java
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
/**
* 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 L, int R) {
if(root==null){
return 0;
}else{
if(root.val > R){
return rangeSumBST(root.left,L,R);
}
if(root.val < L){
return rangeSumBST(root.right,L,R);
}
return root.val + rangeSumBST(root.left,L,R) + rangeSumBST(root.right,L,R);
}
}
}