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 votes139 views1 answer
How to rezize image in python tkinter
Python
7 votes149 views6 answers
Python function
Python
0 vote161 views1 answer
Python chatbot error
Python
1 vote150 views1 answer
Heroku change python version
Python
0 vote135 views2 answers
Pandas agg rename columns
Python
22 votes154 views6 answers
Python palindrome program
Python
-1 vote144 views1 answer
Count variable in class python
Python
0 vote184 views1 answer
Django customize the user model
Python Django
11 votes180 views5 answers
Pandas dataframe delete column
Python
0 vote138 views1 answer
Python on read text execute command
Python