938. Range Sum of BST

Given the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive).
The binary search tree is guaranteed to have unique values.

Example 1:
Input: root = [10,5,15,3,7,null,18], L = 7, R = 15
Output: 32

Example 2:
Input: root = [10,5,15,3,7,13,18,1,null,6], L = 6, R = 10
Output: 23

def rangeSumBST(self, root, L, R):
        """
        :type root: TreeNode
        :type L: int
        :type R: int
        :rtype: int
        """
        return self.inorder(root,0,L,R)
    def inorder(self,root,value,L,R):
        if root:
            value=self.inorder(root.left,value,L,R)
            if root.val>=L and root.val<=R:
                value+=root.val
            value=self.inorder(root.right,value,L,R)
        return value