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 vote146 views1 answer
Post an image Flask
Python
3 votes181 views2 answers
Remove duplicates function python
Python
0 vote156 views1 answer
Create new column with length of old column value python
Python
0 vote152 views1 answer
Markers are not visible on line plot
Python
0 vote143 views1 answer
Sxrf argument missing from post
Python
4 votes145 views2 answers
Tkinter draw squaer
Python
0 vote142 views1 answer
What is best app for Python
Python
1 vote141 views2 answers
String array to float array python
Python
0 vote202 views1 answer
Python Split list into chunks using itertools Method
Python
3 votes133 views3 answers
Get title beautifulsoup
Python