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 vote110 views1 answer
Arch linux python 3.7
Python
9 votes113 views6 answers
How to create list in python
Python
5 votes102 views4 answers
Django get or 404
Python
0 vote114 views1 answer
Key item loop list python
Python
11 votes98 views3 answers
Practicing python
Python
3 votes93 views1 answer
Read .dat python
Python
2 votes110 views2 answers
Save a Dictionary to File in Python Using the dump Function of the pickle Module
Python
0 vote133 views1 answer
Pass query params django template
Python Django
6 votes90 views2 answers
Get_or_create django
Python Django
3 votes106 views2 answers
Catch error python
Python