<reponame>AtharvRedij/leetcode-solutions
'''
URL: https://leetcode.com/problems/range-sum-of-bst/

Difficulty: Easy

Description: 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
 

Note:

The number of nodes in the tree is at most 10000.
The final answer is guaranteed to be less than 2^31.

'''

# Definition for a binary tree node.


class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right


class Solution:
    def __init__(self):
        self.add = 0

    def rangeSumBST(self, root, L, R):
        if root:
            if L <= root.val <= R:
                self.add += root.val
            if L < root.val:
                self.rangeSumBST(root.left, L, R)
            if root.val < R:
                self.rangeSumBST(root.right, L, R)

        return self.add

'''
URL: https://leetcode.com/problems/range-sum-of-bst/

Difficulty: Easy

Description: 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
 

Note:

The number of nodes in the tree is at most 10000.
The final answer is guaranteed to be less than 2^31.

'''

# Definition for a binary tree node.


class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right


class Solution:
    def __init__(self):
        self.add = 0

    def rangeSumBST(self, root, L, R):
        if root:
            if L <= root.val <= R:
                self.add += root.val
            if L < root.val:
                self.rangeSumBST(root.left, L, R)
            if root.val < R:
                self.rangeSumBST(root.right, L, R)

        return self.add
URL: https://leetcode.com/problems/range-sum-of-bst/  Difficulty: Easy  Description: 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    Note:  The number of nodes in the tree is at most 10000. The final answer is guaranteed to be less than 2^31. # Definition for a binary tree node.