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 vote263 views1 answer
Increase pie chart size python
Python
16 votes179 views6 answers
Python print function
Python
0 vote195 views1 answer
Request.build_absolute_uri django
Python
0 vote198 views1 answer
Python string: indexing and slicing string
Python
0 vote180 views1 answer
Jpg image in tkinter title
Python
0 vote343 views2 answers
Initialize empty dictionary python
Python
0 vote188 views3 answers
Best python programs
Python
31 votes178 views3 answers
Python get names of columns
Python
3 votes201 views2 answers
Lda scikit learn
Python
18 votes196 views4 answers
How to play audio in python
Python