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 vote379 views2 answers
Generate random token or id in django
Python Django
1 vote381 views2 answers
Python remove dict key/values
Python
0 vote349 views1 answer
Django builtin signals
Python Django
0 vote359 views1 answer
Which function is used to write all the characters?
Python
0 vote324 views1 answer
Combine two dictionary adding values for common keys
Python
1 vote362 views1 answer
Creating dictionary using the keys
Python
0 vote361 views1 answer
Flash not defined python flask
Python
0 vote365 views1 answer
Python align output
Python
1 vote342 views1 answer
Count number of repeats in list python
Python
31 votes352 views6 answers
Count list python
Python