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 vote137 views1 answer
How to make a dice program in python
Python
5 votes99 views2 answers
Change space to underscore python
Python
1 vote153 views1 answer
TypeError: ‘builtin_function_or_method’ object is not subscriptable
Python
1 vote142 views1 answer
How to swap in list in python
Python
5 votes146 views2 answers
Scroll to element python selenium
Python
0 vote147 views1 answer
Spevify datatype of column
Python
0 vote142 views1 answer
Python function guts
Python
1 vote238 views1 answer
Cannot be loaded as Python module
Python
0 vote125 views1 answer
Check for double character in a string python
Python
9 votes162 views1 answer
How to read csv from local files
Python