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 vote181 views1 answer
Using Lists as Queues
Python
0 vote176 views2 answers
Install python 3.6 on centos
Python
3 votes172 views1 answer
Selenium other item would revieve click
Python
6 votes181 views4 answers
Remove outliers python dataframe
Python
0 vote190 views1 answer
Polyfit python
Python
0 vote231 views1 answer
ComplexWarning: Casting complex values to real discards the imaginary part
Python
0 vote162 views1 answer
How to remove text in pygame
Python
0 vote160 views1 answer
Solve system of linear equations numpy
Python
7 votes165 views6 answers
Python random word
Python
0 vote211 views4 answers
Concat dicts python
Python