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

-1 vote321 views1 answer
Python check if string is url
Python
1 vote371 views2 answers
Openfiledialog python
Python
30 votes339 views3 answers
For c in range python
Python
15 votes323 views3 answers
Remove word from string python
Python
2 votes340 views1 answer
Matplotlib savefig not working
Python
35 votes308 views2 answers
Pwd python
Python
1 vote334 views1 answer
Import different module based on python version
Python
1 vote387 views1 answer
Flask blueprints
Python Flask
11 votes317 views2 answers
Save machine learning model
Python
0 vote318 views1 answer
RuntimeError: Tensor for 'out' is on CPU, Tensor for argument #1 'self' is on CPU, but expected them to be on GPU
Python