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

25 votes165 views3 answers
Python find number of occurrences in list
Python
3 votes206 views3 answers
Flask migrate install
Python Flask
9 votes192 views2 answers
Python write yaml
Python
2 votes180 views2 answers
How to make a clock in python 3
Python
34 votes198 views6 answers
Name columns pandas
Python
0 vote164 views1 answer
Python lvl up
Python
0 vote229 views1 answer
Staticmethod vs classmethod python
Python
0 vote186 views2 answers
Install pyttsx3
Python
1 vote207 views1 answer
Yesno django
Python
0 vote163 views1 answer
Math expressions with matplotlib
Python