[Python] Recursive + Memory usage less than 93%
Upvote if it was usefull for you \uD83D\uDE42\n\n```\nclass Solution:\n    def rangeSumBST(self, root: Optional[TreeNode], low: int, high: int) -> int:\n       
Upvote if it was usefull for you \uD83D\uDE42\n\n```\nclass Solution:\n    def rangeSumBST(self, root: Optional[TreeNode], low: int, high: int) -> int:\n        suma = 0\n        def search(node):\n            nonlocal suma\n            if node:\n                if node.val <= high and node.val >=low:\n                    suma+=node.val\n                search(node.left)\n                search(node.right)\n        search(root)\n        return(suma)
['Recursion', 'Python']