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

46 votes358 views3 answers
Pandas apply function to every row
Python
9 votes336 views1 answer
Create models in django
Python
0 vote319 views1 answer
Resizing django embed player
Python
2 votes342 views1 answer
How to merge between two columns and make a new one in pandas dataframe
Python
0 vote358 views1 answer
P and c in python
Python
1 vote343 views1 answer
Python read integer from stdin
Python
14 votes335 views3 answers
Pyautogui down arrow
Python
1 vote324 views1 answer
Python requests set header cookie
Python
0 vote322 views1 answer
How to see if something is in a class in python
Python
92 votes327 views6 answers
Python create virtualenv
Python