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

52 votes286 views6 answers
Python new line
Python
2 votes332 views1 answer
How to draw polygon in tkinter
Python
0 vote298 views1 answer
Tkinter simple notification
Python
0 vote291 views1 answer
Tuple parameter function python is None
Python
0 vote298 views1 answer
What are zinc bandages used for?
Python
8 votes305 views3 answers
Len python
Python
1 vote329 views1 answer
3d array into 2d array python
Python
0 vote299 views1 answer
Python get num chars
Python
1 vote315 views3 answers
Django reverse
Python
7 votes295 views6 answers
Hello world in python
Python