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

6 votes265 views5 answers
How to redirect in django
Python
0 vote258 views2 answers
Python sorting array without inbuilt sort
Python
4 votes326 views4 answers
Use python3 as default mac
Python
0 vote255 views2 answers
Comment faire un long commentaire en python
Python
0 vote298 views1 answer
RuntimeError: Please set pin numbering mode using GPIO.setmode(GPIO.BOARD) or GPIO.setmode(GPIO.BCM)
Python
0 vote230 views1 answer
Python read textfile
Python
1 vote257 views2 answers
Access element of dataframe python
Python
0 vote250 views1 answer
Change python from 3.8 to 3.7
Python
26 votes268 views3 answers
Check if variable is empty python
Python
0 vote262 views1 answer
Python program to switch first and second characters in a string
Python