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

2 votes193 views2 answers
No module named 'storages'
Python
0 vote201 views1 answer
How to assign a tuple to a cell in pandas dataframe
Python
1 vote198 views2 answers
Keras sequential layer
Python
2 votes144 views1 answer
Python safe get from dict
Python
0 vote190 views1 answer
Make blinking text python
Python
10 votes211 views3 answers
Accessing element from csv file in python
Python
25 votes201 views6 answers
Python if
Python
0 vote199 views1 answer
Standardscaler
Python
0 vote183 views1 answer
Django Abstract base classe
Python
1 vote198 views1 answer
Python retry
Python