BFS Iterative Binary Tree Traversal

bfs_iterative_binary_tree_traversal.py

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


from collections import deque


def bfs_iterative_binary_tree_traversal(root: TreeNode):
  if not root:
    return
  
  queue = deque([root])
  while queue:
    node = queue.popleft()
    # process the node
    print(node.val)
    
    if node.left:
      queue.append(node.left)
    if node.right:
      queue.append(node.right)