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 vote166 views1 answer
Django get form data from post
Python
0 vote164 views1 answer
Django bootstrap
Python
31 votes183 views4 answers
Python remove nan rows
Python
42 votes173 views6 answers
If key in dictionary python
Python
0 vote169 views1 answer
Pyplot new figure
Python
8 votes163 views1 answer
Append one row to pandas dataframe
Python
-86 votes165 views10 answers
Code
Python
0 vote235 views1 answer
Keep tkinter window below others
Python
0 vote215 views1 answer
Regex for repeating words python
Python
145 votes170 views5 answers
Create file python
Python