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 vote164 views1 answer
Remove or drop rows and columns with null values
Python
0 vote157 views1 answer
Latex maths to python parser
Python
-1 vote143 views2 answers
Turn off grid in matplotlib 3d
Python
1 vote165 views1 answer
Seaborn jointplot regression
Python
0 vote144 views1 answer
How to get function help in jupyter notebook
Python
1 vote148 views1 answer
Why does python round 0.5 to 0
Python
0 vote156 views1 answer
‘A’, ‘Q’, ‘BM’, ‘BA’, ‘BQ’ meaning in resample
Python
0 vote156 views1 answer
Pandas replace last cell
Python
4 votes151 views3 answers
Python indexing
Python
1 vote157 views1 answer
Df.fillna(-999,inplace=True)
Python