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

0 vote275 views1 answer
Neopixel thonny python
Python
24 votes361 views6 answers
Static files in django
Python Django
4 votes248 views1 answer
Pandas find inf values
Python
1 vote280 views1 answer
ValueError: There may be at most 1 Subject headers in a message
Python
6 votes270 views2 answers
What is in the python built in namespace
Python
0 vote249 views1 answer
Go to line in jetbrain
Python
0 vote257 views1 answer
Rotch randn
Python
2 votes234 views2 answers
Python check if key exist in json
Python
4 votes262 views2 answers
Plot distribution seaborn
Python
0 vote262 views1 answer
Paho mqtt reconnect in python
Python