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 vote196 views2 answers
Django rest framework authentication
Python Django
10 votes187 views3 answers
Django make migrations
Python Django
0 vote139 views1 answer
Print each item in list python single statemnt
Python
4 votes147 views2 answers
Random int in python 3
Python
0 vote153 views1 answer
Show every second xtick
Python
0 vote163 views1 answer
Hex string to hex number
Python
0 vote182 views1 answer
Https://practice.geeksforgeeks.org/problems/coin-change2448/1
Python
1 vote181 views1 answer
First openfaas python function
Python
0 vote160 views1 answer
Program to find the largest of three numbers in python
Python
1 vote145 views1 answer
Python array append extend
Python