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

23 votes188 views6 answers
How to take input for list in python
Python
0 vote240 views1 answer
Search number is complete or no python
Python
3 votes192 views2 answers
How to print answer 2 decimal places in python 3
Python
0 vote196 views5 answers
How to count the iteration a list python
Python
2 votes156 views1 answer
Os.getlogin() python
Python
0 vote178 views1 answer
Random string generate python of 2.7
Python
0 vote231 views1 answer
How to compress image field in django?
Python
5 votes248 views4 answers
Import user in django
Python Django
-1 vote182 views1 answer
How to normalize a 1d numpy array
Python
0 vote175 views1 answer
Python does strftime work with date objects
Python