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 vote335 views1 answer
Printing multiple input in python
Python
11 votes360 views4 answers
Invert dictionary python
Python
6 votes333 views3 answers
Pandas drop empty columns
Python
0 vote334 views1 answer
Pandas earliest date in column
Python
0 vote378 views1 answer
Python selenium login button class click
Python
38 votes320 views2 answers
How to get the contents of a txt file in python
Python
0 vote301 views1 answer
Cudf - merge dataframes
Python
10 votes389 views1 answer
Pandas slice based on column value
Python
0 vote310 views1 answer
Create pytorch zeros
Python
-1 vote347 views6 answers
List comprehension python
Python