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

12 votes183 views6 answers
Python remove empty string from list
Python
0 vote215 views1 answer
Keyerror: 'acc' in keras
Python
0 vote190 views2 answers
Trace table python
Python
2 votes233 views2 answers
How to translate to string to different alphabet python
Python
32 votes198 views10 answers
Google translate
Python
1 vote175 views1 answer
_set in django
Python
2 votes178 views1 answer
Matplotlib insert text
Python
9 votes181 views4 answers
Scikit learn random forest
Python
0 vote193 views2 answers
Py search and get objects from array
Python
0 vote186 views1 answer
Python turtle draw 3 concentric circles
Python