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

0 vote395 views2 answers
Django template date format yyyy-mm-dd
Python Django
0 vote358 views1 answer
C++ vs python
Python
1 vote331 views1 answer
Flask post vs get
Python
0 vote322 views1 answer
Iterating over the two ranges simultaneously
Python
0 vote327 views1 answer
Django rest_framework-social-oauth2
Python
43 votes331 views3 answers
Python system arguments
Python
0 vote341 views1 answer
Python word cloud
Python
4 votes316 views3 answers
Formatting strings in python
Python
0 vote356 views1 answer
Dataframe fill none
Python
4 votes345 views1 answer
Get current url python
Python