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 vote346 views1 answer
Upgrade python to 3.9 i linux
Python
52 votes358 views2 answers
What is index in list in python
Python
5 votes355 views1 answer
UnicodeDecodeError: 'charmap' codec can't decode byte 0x9e in position 3359: character maps to <undefined>
Python
25 votes339 views3 answers
Python warnings as error
Python
0 vote339 views1 answer
Python program for simple interest
Python
30 votes326 views2 answers
Python array usage
Python
68 votes353 views2 answers
Pyton do while loop+
Python
0 vote426 views1 answer
MULTIPLE Model Search in Django rest framework
Python Django
3 votes333 views1 answer
Factorial python for loop
Python
0 vote367 views1 answer
Increase recursion depth google colab
Python