Python invert binary tree

from collections import deque
def levelOrderTraversal(root):
    q = deque()
    q.append(root)
    while q:
        curr = q.popleft()
        print(curr.data, end=' ')
        if curr.left:
            q.append(curr.left)
        if curr.right:
            q.append(curr.right)

Source: medium.com

Similar codes

3 votes104 views1 answer
Python loop back to start
Python
2 votes99 views1 answer
Dataframe get row by name
Python
0 vote91 views1 answer
1 min candle resampling pandas
Python
0 vote90 views1 answer
DJANGO model instance get by variable
Python
1 vote112 views2 answers
How to print text in python
Python
0 vote120 views1 answer
Show all urls django extensions
Python Django
1 vote97 views3 answers
Unsplash source
Python
1 vote96 views1 answer
Django get part of queryset
Python
0 vote101 views1 answer
Sklearn impute
Python
0 vote100 views1 answer
How to find permutation of numbers in python
Python