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

5 votes230 views2 answers
My django template doesnt want to load the static file
Python Django
1 vote187 views2 answers
Python how to print variable value
Python
12 votes172 views3 answers
Setwd python
Python
1 vote169 views1 answer
How to get last values or data in django orm
Python
0 vote158 views1 answer
Tensor.numpy() pytorch gpu
Python
6 votes174 views4 answers
* pattern program in python
Python
0 vote179 views1 answer
Async, await, python
Python
2 votes183 views2 answers
How to install pywin32 python
Python
-1 vote154 views1 answer
How to block a ip adress
Python
1 vote164 views1 answer
Python line chart
Python