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 vote232 views1 answer
Replit python keep discord bot online
Python
5 votes238 views2 answers
How to say that an input needs to be a number python
Python
1 vote226 views1 answer
Python link to jpg
Python
-1 vote249 views2 answers
How to url encode using python django
Python Django
1 vote229 views1 answer
Tkinter listbox delete all items
Python
9 votes191 views2 answers
TypeError: method() takes 1 positional argument but 2 were given
Python
0 vote197 views1 answer
ModuleNotFoundError: No module named 'timeago'
Python
1 vote201 views2 answers
Python copy variable
Python
1 vote205 views1 answer
What is nea in python
Python
11 votes247 views2 answers
Discord.py presence
Python