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 votes135 views2 answers
Write in entry() in tkinter
Python
1 vote252 views1 answer
Sum values in django models
Python
1 vote136 views1 answer
List.extend
Python
1 vote206 views1 answer
Django manager
Python Django
0 vote136 views1 answer
Find root of the path of file os package
Python
0 vote152 views1 answer
Django dumpdata specific app
Python
0 vote144 views1 answer
Python ai for stock trading
Python
9 votes130 views6 answers
Pattern python
Python
0 vote176 views1 answer
C Pythagorean triples
Python
0 vote147 views2 answers
Selenium screenshot python user agent
Python