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

5 votes294 views2 answers
Python fetch url
Python
6 votes331 views1 answer
Selectfield flask wtf
Python
5 votes298 views1 answer
Python put quotes in string
Python
3 votes297 views3 answers
Python create dictionary from csv
Python
1 vote353 views1 answer
Phone number regex python
Python
6 votes289 views2 answers
Migrate data django
Python
13 votes294 views5 answers
How to check for missing values in pandas
Python
0 vote337 views1 answer
Super title python
Python
1 vote308 views1 answer
Python print string name in pattern
Python
3 votes297 views6 answers
Fizz buzz python
Python