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 vote280 views1 answer
Load data(review path) python
Python
0 vote290 views2 answers
How to store the variable in dictionary
Python
0 vote296 views1 answer
Sort first element reverse sort second python
Python
5 votes279 views5 answers
Python space separated input
Python
1 vote277 views2 answers
Urllib.error.URLError: <urlopen error [SSL: CERTIFICATE_VERIFY_FAILED] certificate verify failed: self signed certificate in certificate chain (_ssl.c:997)>
Python
46 votes278 views6 answers
Round to decimal places python
Python
6 votes293 views4 answers
Media django
Python
13 votes374 views3 answers
Django form example
Python Django
0 vote342 views1 answer
Get the list of column names whose data type is float python
Python
-1 vote293 views1 answer
List of letter in word python
Python