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

31 votes117 views3 answers
How to adda vaslues to data frame
Python
8 votes115 views1 answer
Python pdf to image
Python
1 vote76 views1 answer
Python take input from terminal
Python
0 vote116 views4 answers
How save second sheet in excel using python
Python
3 votes137 views2 answers
Python get current mouse position
Python
0 vote131 views2 answers
Phow to install python modules in no internet in sercer
Python
59 votes126 views3 answers
Python find index
Python
0 vote127 views1 answer
Python create unreadable save file
Python
14 votes153 views4 answers
Reset index
Python
3 votes118 views3 answers
Python iterar claves
Python