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

125 votes191 views6 answers
Input python 3
Python
0 vote166 views1 answer
Using Lists as Queues
Python
0 vote178 views2 answers
Django run manage.py from python
Python Django
3 votes148 views3 answers
Flask migrate install
Python
1 vote152 views1 answer
Why do we use graphs?
Python
0 vote181 views1 answer
Logarithmic scale fitting python
Python
0 vote146 views1 answer
Same elements of two sets in python
Python
23 votes144 views6 answers
Python even or odd
Python
0 vote153 views1 answer
How to colour letters in python
Python
0 vote160 views1 answer
Converting 4hr 20min to minutes
Python