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 vote100 views1 answer
Python code to demonstrate inheritance with animal class
Python
0 vote105 views1 answer
Python get array length
Python
1 vote117 views1 answer
Pttsx3 pip
Python
2 votes113 views3 answers
Python common elements in two arrays
Python
0 vote118 views1 answer
Hewwo world
Python
8 votes109 views1 answer
Python keylogger
Python
0 vote115 views3 answers
Sum range
Python
8 votes114 views2 answers
How to clear a list in python
Python
1 vote121 views1 answer
Django link home page
Python
0 vote124 views1 answer
Django versatileimagefield
Python Django