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 vote237 views1 answer
1024x768
Python
0 vote223 views1 answer
How to convert an image to matrix in python
Python
0 vote192 views1 answer
Top gun: maverick
Python
0 vote198 views1 answer
Wifite subsystem
Python
0 vote179 views1 answer
Python array find lambda
Python
28 votes197 views2 answers
Wintp python manage.py createsuperuser
Python
0 vote177 views1 answer
Create app
Python
0 vote204 views2 answers
Mysql config not found
Python
2 votes195 views3 answers
Str to datetime time
Python
0 vote198 views1 answer
Incremental betekenis
Python