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

3 votes133 views2 answers
Django change user password
Python
2 votes144 views1 answer
How to load ui file in pyqt5
Python
1 vote213 views1 answer
Python - Comment chiffrer une boucle
Python
0 vote149 views3 answers
Proxy pool for scrapy
Python
0 vote145 views1 answer
Pytest check exception
Python
0 vote142 views1 answer
Custom jupyter notebook
Python
-1 vote129 views1 answer
Receipt ocr
Python
0 vote120 views1 answer
Days to int
Python
0 vote150 views1 answer
Run python script in synology sample
Python
1 vote112 views1 answer
Python random hex color
Python