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

5 votes232 views3 answers
Python sys
Python
0 vote234 views1 answer
Python override add
Python
88 votes223 views4 answers
Python os remove file
Python
0 vote232 views1 answer
How to scale an array between two values python
Python
5 votes239 views2 answers
Std python
Python
0 vote229 views1 answer
Saleor docker development
Python
12 votes253 views2 answers
Python input integer only
Python
0 vote247 views1 answer
Changing names of column pandas
Python
0 vote230 views1 answer
Scrfoll with selenium python
Python
0 vote236 views1 answer
Increase recursion depth google colab
Python