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 vote143 views1 answer
How to know if i'm in a virtual environment
Python
2 votes165 views1 answer
Get n random numbers from x to y python
Python
0 vote145 views10 answers
Installez django-cruds-adminlte
Python
0 vote142 views3 answers
H2o ai python
Python
5 votes140 views2 answers
Jupyter nbextension
Python
0 vote151 views1 answer
Window freezes after clicking of button in python GTK3
Python
-2 votes140 views1 answer
En_core_web_sm
Python
0 vote165 views1 answer
Csgo force crosshair on sniper python
Python
1 vote135 views1 answer
Python list add if not present
Python
0 vote148 views1 answer
All the symbols on a keyboard python list
Python