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 votes159 views1 answer
Count number items in list python
Python
1 vote162 views1 answer
Les librairies python a maitriser pour faire du machine learning
Python
5 votes187 views3 answers
Python subplot space between plots
Python
0 vote177 views1 answer
Djago get settings
Python
0 vote163 views1 answer
Align a text python
Python
0 vote162 views1 answer
Pycocotools python3.7
Python
1 vote154 views1 answer
Skeppy python
Python
1 vote163 views1 answer
Django manager
Python
0 vote171 views1 answer
MULTIPLE Model Search in Django rest framework
Python
0 vote179 views1 answer
Django get form data from post
Python Django