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

6 votes274 views1 answer
Enter key press bind tkinter
Python
6 votes294 views2 answers
Flask get ip address of request
Python
0 vote319 views1 answer
Use colabs gpu locally
Python
0 vote275 views1 answer
Numpy array with 2 times each value
Python
0 vote295 views1 answer
Arrange array in ascending order python
Python
0 vote298 views1 answer
Pandas, python, dataframes
Python
0 vote298 views1 answer
Return maximum of three values in python
Python
3 votes267 views1 answer
Find duplicated rows with respect to multiple columns pandas
Python
0 vote273 views1 answer
Pandas extracting tables from pdf
Python
27 votes293 views2 answers
Python date get day
Python