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

6 votes256 views2 answers
Markdown image embed url
Python
0 vote229 views1 answer
Python animation
Python
0 vote238 views1 answer
How to type using selenium python
Python
1 vote344 views1 answer
Flask enumerate index
Python Flask
92 votes257 views5 answers
Make a new environment conda
Python
0 vote248 views1 answer
Doc2vec similarity
Python
5 votes249 views2 answers
Finding the format of an image in cv2
Python
0 vote256 views1 answer
Print items of list using list comprehension in python
Python
2 votes236 views3 answers
How to sum digits of a number in python
Python
0 vote285 views1 answer
Draw box with mouse on image in canvas tkinter
Python