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

1 vote218 views1 answer
Tkinter listbox delete all items
Python
6 votes206 views2 answers
Python square a number
Python
3 votes200 views2 answers
Numpy find where max element ist
Python
0 vote190 views2 answers
Wolfram alpha python module
Python
0 vote221 views1 answer
Reversing Ints
Python
0 vote194 views1 answer
How to iclude parcentage in pivot table in pandas
Python
0 vote161 views1 answer
Python google docs api how to get doc index
Python
0 vote200 views1 answer
Matplotlig adding progress bar
Python
0 vote202 views1 answer
F readlines python not working
Python
10 votes213 views3 answers
Python dataframe find no of true
Python