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 vote374 views3 answers
How to create a User and User profile in django rest framework
Python Django
1 vote368 views1 answer
Numpy series reset index
Python
0 vote310 views1 answer
Calculate the euler totient of a number python
Python
1 vote314 views1 answer
Max string length python
Python
0 vote321 views1 answer
What is a console in pythonanywhere
Python
0 vote340 views1 answer
Get timestamp with pyrhon
Python
3 votes356 views1 answer
Flask upload
Python Flask
31 votes285 views1 answer
Sort_values pandas series
Python
0 vote340 views1 answer
How to calculate the variance of all columns in python
Python
0 vote352 views1 answer
Python write subprocess stdout stderr to file
Python