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 vote192 views2 answers
Javascript python
Python
0 vote190 views1 answer
Jugendwort 2019
Python
9 votes192 views2 answers
Import numpy python
Python
0 vote226 views1 answer
Python numpy array check if all nans
Python
6 votes183 views3 answers
Python timestamp
Python
1 vote212 views1 answer
Maximum and minimum value of array python
Python
0 vote216 views1 answer
Python read file to eof
Python
15 votes193 views6 answers
Value_counts() in pandas
Python
36 votes220 views3 answers
Python image library
Python
0 vote201 views1 answer
Df.loc jupyter
Python