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 vote273 views1 answer
Dataframe, groupby, select one
Python
1 vote289 views1 answer
Return result from exec python
Python
0 vote288 views1 answer
Reverse row order padnas
Python
0 vote265 views1 answer
Form a chakravyuh matrix python
Python
0 vote278 views1 answer
Python cv2 how to update image
Python
2 votes237 views1 answer
Dice rolling simulator python
Python
0 vote267 views1 answer
Holding a function to the code in python
Python
8 votes267 views2 answers
Import math sqrt python
Python
0 vote254 views1 answer
Defaultdict count key value pairs
Python
0 vote271 views2 answers
Python concatenation
Python