-
Notifications
You must be signed in to change notification settings - Fork 0
/
226.py
52 lines (46 loc) · 1.18 KB
/
226.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
class TreeNode(object):
def __init__(self, val=0, left=None, right=None):
self.val = val
self.left = left
self.right = right
class Solution(object):
def invertTree(self, root):
"""
:type root: TreeNode
:rtype: TreeNode
"""
if root is None:
return
temp=root.left
root.left=root.right
root.right=temp
self.invertTree(root.left)
self.invertTree(root.right)
return root
def construct_tree(lst):
if lst is None:
return
queue=[]
head=TreeNode(lst[0])
queue.append(head)
i=0
while i < (len(lst)):
while queue:
ele=queue.pop(0)
i+=1
if i<len(lst):
if lst[i] is not None:
new=TreeNode(lst[i])
queue.append(new)
ele.left=new
i+=1
if i<len(lst):
if lst[i] is not None:
new=TreeNode(lst[i])
queue.append(new)
ele.right=new
return head
l=[4,2,7,1,3,6,9]
head=construct_tree(l)
head=Solution().invertTree(head)
print('')