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

2 votes173 views2 answers
Python parentheses
Python
3 votes170 views1 answer
Import py to exe
Python
0 vote129 views1 answer
Get derivative of interp1d
Python
0 vote292 views1 answer
OpenPyXl Get Sheet Names
Python
1 vote151 views2 answers
Explode multiple columns pandas
Python
3 votes164 views1 answer
Load pandas from text
Python
0 vote130 views1 answer
Pydub reproduce audiosegment
Python
0 vote138 views1 answer
Tkinter centre a button on 1920x1080
Python
1 vote121 views1 answer
Filter dataframe columns vy a list of columns
Python
2 votes129 views2 answers
How to find the longest string in a list in python
Python