Leetcode刷题记录——938. 二叉搜索树的范围和

注意理解题意

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def __init__(self):
        self.res = 0
        #self.
    def rangeSumBST(self, root: TreeNode, L: int, R: int) -> int:
        if root == None:
            return 0
        temp_res = root.val
        if temp_res < L:
            self.rangeSumBST(root.right,L,R)
        elif temp_res >R:
            self.rangeSumBST(root.left,L,R)
        else:
            self.res += temp_res
            self.rangeSumBST(root.left,L,R)
            self.rangeSumBST(root.right,L,R)
        return self.res