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 vote159 views1 answer
Python run scp command
Python
0 vote170 views1 answer
Python os.name mac
Python
0 vote209 views1 answer
How to get current google tab in python
Python
0 vote162 views1 answer
Matlab .* operator in python
Python
1 vote158 views2 answers
Django template iterate dict
Python
3 votes165 views1 answer
Python change plot transparency
Python
0 vote201 views10 answers
String float to round to 2dp python
Python
1 vote178 views1 answer
Python find in largest 3 numbers in an array
Python
0 vote169 views4 answers
Django-sslserver · PyPI
Python
0 vote172 views2 answers
Python using dll
Python