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 vote253 views1 answer
Django filter queryset by date
Python
3 votes261 views2 answers
Add sheet to existing workbook openpyxl
Python
268 votes367 views0 answer
Last element of list python
Python
0 vote309 views1 answer
Extract area code from phone number python
Python
4 votes304 views2 answers
Mkvirtualenv environment python 3
Python
26 votes268 views3 answers
Check if variable is empty python
Python
0 vote294 views1 answer
Fastest clicker python
Python
0 vote246 views1 answer
Pyjone location
Python
0 vote222 views2 answers
Tkinter disable resize
Python
13 votes269 views1 answer
Install fastapi
Python