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 vote317 views1 answer
How to remove explicit string concatenation
Python
0 vote299 views1 answer
Python glob how to read all txt files in folder
Python
0 vote285 views1 answer
Get localapplication python
Python
2 votes305 views1 answer
Python apply a function on each element of a array
Python
97 votes273 views6 answers
Download python
Python
0 vote309 views1 answer
Pyplot rectangle over image
Python
17 votes304 views3 answers
Create log in python
Python
65 votes299 views6 answers
Create venv windows
Python
0 vote294 views1 answer
Don't Get Volunteered!
Python
2 votes278 views1 answer
Python sort the values in a dictionaryi
Python