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

1 vote258 views1 answer
Python 3d array
Python
-1 vote272 views1 answer
C is better than python
Python
22 votes326 views6 answers
How to execute a cmd command in python
Python
41 votes268 views6 answers
Python comments
Python
1 vote276 views5 answers
Scrapy proxy pool
Python
12 votes292 views2 answers
Read excel file spyder
Python
0 vote256 views1 answer
Python sklearn linear regression slope
Python
-2 votes310 views1 answer
3d game in python
Python
0 vote301 views1 answer
Grandest staircase foobar
Python
0 vote277 views2 answers
Python difference between multiprocessing Pool and Threadpool
Python