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

1 vote329 views1 answer
How to print list without for loop python
Python
1 vote388 views1 answer
Python how to make notepad
Python
2 votes342 views2 answers
Python get pixel color from screen
Python
1 vote365 views1 answer
Polynomial features random forest classifier
Python
14 votes348 views4 answers
Python permutation
Python
0 vote347 views1 answer
How do i activate python on windows
Python
3 votes371 views1 answer
Creating a virtual environment in python 3.8
Python
0 vote377 views1 answer
Pyqt5 open tab
Python
5 votes340 views2 answers
If df[col].unique()==2
Python
25 votes289 views2 answers
Check if a list of strings is in a string python
Python