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 vote236 views1 answer
How to import axes3D
Python
9 votes230 views2 answers
How to create a new virtualenv
Python
0 vote234 views1 answer
Adding bootstrap grid dynamically django
Python
7 votes223 views3 answers
Dictionary from two columns pandas
Python
0 vote232 views1 answer
Inherit init method
Python
9 votes239 views3 answers
Get first line of file python
Python
0 vote241 views1 answer
Minio python remove an object
Python
0 vote261 views3 answers
Generate binay image python
Python
9 votes178 views1 answer
Convert a string to xml python
Python
0 vote226 views1 answer
Whitespace delimiter python
Python