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

2 votes129 views1 answer
How to use sum with range python
Python
0 vote146 views1 answer
Python send image client
Python
0 vote126 views1 answer
Opening & creating hdf5 file
Python
1 vote162 views1 answer
How to filter queryset with foreign key in django
Python Django
11 votes197 views2 answers
Check if file is txt python
Python
1 vote140 views1 answer
Upgrade pip wheel
Python
0 vote133 views1 answer
Get fields in object python
Python
0 vote125 views1 answer
Set a random seed
Python
11 votes130 views3 answers
Group by count dataframe
Python
0 vote131 views1 answer
Selenium python has no attrirute getText
Python