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

38 votes137 views2 answers
Python to uppercase
Python
0 vote198 views1 answer
Django admin no such table user
Python Django
0 vote265 views1 answer
Shared a local host django
Python Django
1 vote188 views2 answers
Python file basename
Python
0 vote173 views1 answer
At=error code=h10 desc= app crashed python flask
Python
0 vote109 views1 answer
Finetune vision model huggingface pytorch github
Python
2 votes153 views1 answer
Numpy function for calculation inverse of a matrix
Python
0 vote151 views1 answer
Pyqt menubar example
Python
0 vote147 views1 answer
Matplotlib bring plot to front in plots with twin axis
Python
1 vote168 views3 answers
Remove brackets from string python
Python