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 vote317 views1 answer
Tech with tim
Python
0 vote342 views1 answer
Python change terminal name
Python
5 votes348 views2 answers
Python ffmpeg
Python
11 votes332 views3 answers
Dataframe delete row
Python
1 vote322 views1 answer
ModuleNotFoundError: No module named 'transforms3d'
Python
2 votes338 views1 answer
Add header to table in pandas
Python
8 votes302 views3 answers
Scikit learn roc curve
Python
33 votes309 views4 answers
Split word python
Python
-2 votes295 views9 answers
Django
Python Django
0 vote313 views1 answer
Python - Comment lire une ligne de fichier par ligne
Python