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 vote131 views1 answer
Python split space or tab
Python
-1 vote127 views1 answer
Extract DATE from pandas
Python
0 vote141 views1 answer
Pythagore
Python
1 vote124 views1 answer
ModuleNotFoundError: No module named 'rospkg'
Python
0 vote123 views1 answer
Falcon 900 price
Python
63 votes170 views6 answers
Index in python
Python
1 vote143 views1 answer
Heroku requirements.txt python
Python
0 vote129 views1 answer
Setting up a django prostgress project
Python
-1 vote173 views1 answer
Flask set mime type
Python Flask
0 vote184 views1 answer
Programação funcional python - lambda
Python