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

1 vote273 views1 answer
Change color of butto in thkinter
Python
0 vote279 views1 answer
How to compare list and int in python
Python
0 vote278 views1 answer
Is root node an internal node
Python
0 vote281 views1 answer
Python how to add a string to the beginning of a list
Python
4 votes279 views3 answers
Pandas remove time from datetime
Python
6 votes258 views1 answer
Python tkinter close gui window
Python
0 vote271 views1 answer
Vscode how to extend output size in jupyter notebook
Python
1 vote288 views1 answer
Implement stack using list in python
Python
0 vote294 views1 answer
Hash python png
Python
0 vote328 views1 answer
Flask windows auto reload
Python Flask