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

from collections import deque

def bfs_find(root, x):
    if not root:
        return None

    q = deque()
    q.append(root)

    while q:
        cur = q.popleft()
        if cur.val == x:
            return cur
        ______________________

    return None