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

6 votes188 views1 answer
Copy file in python3
Python
1 vote263 views2 answers
Django content type
Python Django
0 vote277 views1 answer
Pyspark rdd method
Python
0 vote226 views1 answer
Fast way to load mongodb data into python list
Python
2 votes222 views1 answer
YAMLLoadWarning: calling yaml.load() without Loader=... is deprecated, as the default Loader is unsafe. Please read https://msg.pyyaml.org/load for full details.
Python
0 vote181 views1 answer
Python sns lable axes
Python
0 vote187 views1 answer
Create a python file and import it as library in other file
Python
0 vote175 views1 answer
Save jupyter notebook session
Python
4 votes184 views2 answers
Python get stock data
Python
0 vote195 views1 answer
Lucky four codechef solution
Python