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 vote99 views1 answer
How to change padding of dbc.col
Python
0 vote106 views1 answer
Play Audio File In Background Python
Python
5 votes95 views1 answer
Difference between list vs set vs map in java
Python
0 vote149 views1 answer
(django)inorder to provide a human readable name for the model.
Python Django
2 votes94 views1 answer
Python for loop with increment
Python
0 vote91 views1 answer
How to check if a list is a subset of another list
Python
1 vote95 views2 answers
Found features with object datatype
Python
0 vote90 views3 answers
Mechanize python fill
Python
3 votes109 views3 answers
String list to list
Python
0 vote100 views1 answer
PHP echo multiple lines example Using concatenation assignment operator
Python