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

20 votes105 views1 answer
Python time a funciton
Python
1 vote118 views1 answer
Service
Python
0 vote98 views1 answer
Hungarian algorithm python
Python
1 vote89 views6 answers
Online python pytorch free compiler
Python
2 votes106 views1 answer
Comparing file content in python
Python
0 vote132 views2 answers
How to get a specific field in django
Python
0 vote90 views1 answer
Get maximum values in a column by a subgroup of a dataframe pandas
Python
1 vote105 views2 answers
Python 7zip extract
Python
0 vote88 views1 answer
Python selenium send keys enter send
Python
1 vote102 views1 answer
Different states of a button tkinter
Python