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 vote245 views1 answer
Write a line to a text file using the write() function
Python
0 vote191 views1 answer
Get users except superuser django
Python
0 vote247 views1 answer
Os.startfile on raspberry
Python
3 votes196 views2 answers
How to make python code run faster
Python
1 vote203 views1 answer
How will you print space and stay on the same line in python
Python
3 votes217 views1 answer
Python input separated by
Python
3 votes180 views2 answers
Python generators
Python
1 vote235 views1 answer
Telnet python
Python
0 vote198 views1 answer
Alexa python get slot value
Python
1 vote192 views1 answer
Python define an array with length
Python