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

1 vote125 views1 answer
Python print dict new line
Python
0 vote117 views1 answer
How to add base map in pyqgis
Python
1 vote117 views1 answer
Filter foreign fileds django_filters
Python
0 vote112 views1 answer
Swap two lists without using third variable python
Python
17 votes168 views4 answers
Bubble sort python
Python
2 votes111 views2 answers
AttributeError: module 'tensorflow._api.v2.train' has no attribute 'RMSPropOptimizer' site:stackoverflow.com
Python
-1 vote152 views1 answer
Import http response in django
Python Django
0 vote121 views1 answer
Gene wilder pure imagination
Python
0 vote113 views1 answer
Pytorch multiply tensors element by elementwise
Python
0 vote116 views1 answer
Extrapolate python
Python