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

4 votes217 views2 answers
How to make never ending program in python
Python
0 vote186 views1 answer
Derivative of multivariable function pytorch
Python
1 vote216 views1 answer
Flatten tf keras
Python
6 votes187 views1 answer
Python in godot
Python
0 vote201 views1 answer
Enumerate to skip items
Python
0 vote195 views1 answer
Python calander from Programmer of empires but updated
Python
30 votes215 views4 answers
Python generate list of random numbers
Python
3 votes205 views2 answers
Train_size
Python
2 votes204 views1 answer
Check if user log in flask
Python
1 vote196 views2 answers
Left click pyautogui
Python