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 vote358 views1 answer
Python get last element of iterator
Python
0 vote365 views2 answers
How to write a python script to find the value of x at a given y value
Python
0 vote385 views1 answer
Django fixtures. To loaddata
Python Django
0 vote392 views2 answers
How to schedule python script in windows
Python
73 votes340 views6 answers
Python round to two decimals
Python
0 vote282 views1 answer
Opencv change color
Python
0 vote349 views1 answer
Python close browser
Python
1 vote346 views1 answer
Python docker api example
Python
1 vote332 views3 answers
Solve linear system python
Python
1 vote335 views1 answer
Utc to local time python
Python