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 vote257 views2 answers
Python creare una list comprehension
Python
1 vote290 views3 answers
Pascal's triangle python
Python
0 vote243 views1 answer
Access twitter api using tweepy in python
Python
0 vote250 views1 answer
Matrix diagonal sum leetcode in java
Python
2 votes243 views2 answers
Last element python
Python
3 votes243 views1 answer
Remove after and before space python
Python
189 votes316 views10 answers
New Year's Eve
Python
8 votes249 views3 answers
Loop through a column in pandas
Python
0 vote262 views1 answer
Python program to multiply two numbers and multiply the answer with 2nd variables
Python
3 votes247 views2 answers
Swap list items in python
Python