forked from DmrfCoder/AlgorithmAndDataStructure
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path66.py
91 lines (79 loc) · 2.03 KB
/
66.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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
# -*- coding:utf-8 -*-
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
def Serialize(self, root):
# write code here
if root is None:
s = 'n'
return s
a = []
a.append(root)
s = ''
while len(a) != 0:
curNode = a[0]
del a[0]
if curNode.val != 'n':
s = s + '/' + str(curNode.val)
if curNode.left is not None:
a.append(curNode.left)
else:
a.append(TreeNode('n'))
if curNode.right is not None:
a.append(curNode.right)
else:
a.append(TreeNode('n'))
else:
s = s + '/n'
return s
def Deserialize(self, s):
# write code here
if s == 'n':
return None
array = s.split('/')
del array[0]
root = TreeNode(int(array[0]))
del array[0]
p = root
b = [p]
while len(array) != 0 and len(b) != 0:
innerP = b[0]
del b[0]
temp1 = array[0]
del array[0]
if temp1 == 'n':
innerP.left = None
else:
leftn=int(temp1)
innerP.left = TreeNode(leftn)
b.append(innerP.left)
temp2 = array[0]
del array[0]
if temp2 == 'n':
innerP.right = None
else:
rightn=int(temp2)
innerP.right = TreeNode(rightn)
b.append(innerP.right)
return root
s = Solution()
pRoot = TreeNode(8)
node1 = TreeNode(6)
node2 = TreeNode(10)
node3 = TreeNode(5)
node4 = TreeNode(7)
node5 = TreeNode(9)
node6 = TreeNode(11)
pRoot.left = node1
pRoot.right = node2
node1.left = node3
node1.right = node4
node2.left = node5
node2.right = node6
str = s.Serialize(pRoot)
print str
root=s.Deserialize(str)
a=0