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 vote223 views1 answer
Python how to make a png
Python
1 vote199 views1 answer
How to manipulate audio in python
Python
0 vote220 views1 answer
Discord.py embed length greater than 1024
Python
0 vote217 views1 answer
Load pandas dataframe with one row per line and 1 column no delimiter
Python
11 votes212 views4 answers
Create a 2d array in python
Python
2 votes225 views2 answers
If else pandas dataframe
Python
1 vote217 views1 answer
Python font family list
Python
1 vote233 views1 answer
Django ModelChoiceField value not id
Python
2 votes207 views2 answers
How to use google translate api in python
Python
0 vote224 views1 answer
How to read then overwrite a file with python with truncate
Python