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 vote185 views1 answer
Sklean tfidf
Python
0 vote98 views1 answer
Pandas read all csv in folder
Python
15 votes135 views5 answers
Mouse in pygame
Python
0 vote139 views1 answer
Matplotlib set y lim
Python
1 vote130 views1 answer
How to print a list of strings in python
Python
0 vote192 views1 answer
Selenium page down key python
Python
1 vote125 views1 answer
How to take list of float as input in python
Python
1 vote146 views2 answers
Check if user has manage messages discord.py
Python
60 votes146 views6 answers
List files in directory python
Python
5 votes179 views2 answers
Pandas conditional collumn
Python