Python breadth first search

# tree level-by-level traversal. O(n) time/space
def breadthFirstSearch(root):
    q = [root]

    while q:
        current = q.pop(0)
        print(current)
        if current.left is not None: q.append(current.left)
        if current.right is not None: q.append(current.right)

Similar codes

32 votes249 views3 answers
Python move files
Python
0 vote251 views1 answer
Form a chakravyuh matrix python
Python
0 vote386 views1 answer
OduleNotFoundError: No module named 'absl'
Python
0 vote271 views2 answers
Completely uninstall python and all vritualenvs from mac
Python
0 vote229 views1 answer
How to replace first line of a textfile python
Python
0 vote224 views1 answer
Count occurrences of one variable grouped by another python
Python
0 vote258 views1 answer
Qtoverlay
Python
6 votes270 views4 answers
Np.random.seed
Python
0 vote296 views1 answer
Python Django Models Unique Rows
Python Django
12 votes258 views2 answers
Convert list to array python
Python