[Leetcode][python] 938: Range sum BST - BFS

Problem

• Leetcode 938: Range sum BST
• Level: Easy
• Link

Range Sum of BST - LeetCode

My Approach

# 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 rangeSumBST(self, root: TreeNode, low: int, high: int) -> int:
        
        queue = []
        sum_of_node = 0
        queue.append(root)
        while True:
            n = len(queue)
            if n <= 0:
                break
            while n > 0:
                node = queue.pop(0)
                if  low <= node.val <= high:
                    sum_of_node += node.val
                if node.left:
                    queue.append(node.left)
                if node.right:
                    queue.append(node.right)
                n -= 1
                
        return sum_of_node