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 vote135 views2 answers
Split dataframe into multiple parts
Python
31 votes166 views6 answers
Python strip whitespace
Python
0 vote125 views1 answer
Python datetime now only hour and minute
Python
1 vote145 views1 answer
Save video cv2
Python
92 votes132 views5 answers
Make a new environment conda
Python
4 votes126 views1 answer
Python install command in linux
Python
0 vote124 views1 answer
How to move the element of an array in python by one step
Python
2 votes121 views2 answers
Open terminal in python
Python
2 votes115 views1 answer
Replacing spaces in a string python
Python
0 vote128 views1 answer
Data don't retrieve from database view in django
Python