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 vote220 views1 answer
Python - Comment convertir le texte en discours
Python
1 vote208 views2 answers
Python wget download
Python
1 vote192 views3 answers
Pascal triangle python
Python
20 votes214 views6 answers
Python generate random password
Python
0 vote255 views1 answer
Encoding character or string to integer in python
Python
1 vote215 views1 answer
How to find the length of a list in scratch
Python
0 vote234 views1 answer
Python string lower method
Python
0 vote201 views1 answer
Cm to m in python
Python
0 vote180 views1 answer
How to assign value to variable in Python
Python
0 vote229 views1 answer
Python argparse only allow certain values
Python