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

8 votes103 views3 answers
Isnumeric python
Python
144 votes67 views9 answers
Python write to file
Python
6 votes105 views6 answers
Tuple in python
Python
1 vote106 views1 answer
Plot normal distribution python
Python
1 vote103 views1 answer
Regression r2 tensor flow
Python
0 vote108 views1 answer
Pytorch use multiple gpu
Python
0 vote107 views1 answer
Matplotlib FiveThirtyEight horizontal graph
Python
0 vote119 views1 answer
Python run async function without await
Python
4 votes97 views1 answer
Np array value count
Python
-86 votes103 views10 answers
Code
Python