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

3 votes179 views2 answers
Import file from parent directory python
Python
1 vote187 views1 answer
Multiple pdf to csv python
Python
83 votes172 views6 answers
How to check python version in cmd
Python
1 vote171 views1 answer
How to trim mp4 with moviepy
Python
0 vote185 views1 answer
Raising a new style class which doesn't inherit from baseexception python
Python
2 votes175 views1 answer
Tkinter info box
Python
-1 vote144 views1 answer
Django any() function raw sql query
Python
3 votes182 views1 answer
Python loop through column in dataframe
Python
1 vote195 views1 answer
Python loop until condition met
Python
1 vote242 views1 answer
Python string like pattern
Python