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

0 vote187 views1 answer
Shorten all floats in a list
Python
81 votes172 views6 answers
How to clear console in python
Python
0 vote239 views2 answers
Python x y coordinates
Python
0 vote260 views1 answer
How to write to a netcdf file using xarray
Python
0 vote182 views1 answer
Convert a text file data to dataframe in python without pandas
Python
1 vote123 views3 answers
Python is float function
Python
6 votes196 views2 answers
How to run a File using python
Python
3 votes166 views1 answer
Factorial program
Python
8 votes156 views3 answers
Pip install safely in jupyter
Python
0 vote172 views1 answer
Change every element of list python with map
Python