-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path297-serialize-and-deserialize.py
84 lines (59 loc) · 2.09 KB
/
297-serialize-and-deserialize.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
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Codec:
def serialize(self, root):
"""Encodes a tree to a single string.
:type root: TreeNode
:rtype: str
"""
if root == None:
return []
queue = deque()
queue.append(root)
result = []
while queue:
item = queue.popleft()
if item:
result.append(item.val)
queue.append(item.left)
queue.append(item.right)
else:
result.append("null")
print(result)
return result
def deserialize(self, data):
"""Decodes your encoded data to tree.
:type data: str
:rtype: TreeNode
"""
self.elem_ptr = 0
def get_next_elem():
# if self.elem_ptr < len(data) - 1:
self.elem_ptr += 1
return data[self.elem_ptr]
if len(data) == 0:
return
root = TreeNode(data[0])
queue = deque()
queue.append(root)
while queue and self.elem_ptr < len(data) - 1:
item = queue.popleft()
print(item.val)
if item: #item exists, so add its children (even if they are null)
#add its left child
item.left = TreeNode(get_next_elem())
#add its right child
item.right = TreeNode(get_next_elem())
queue.append(item.left)
queue.append(item.right)
else: #item doesn't exist, so no need to children; advance elem_ptr
get_next_elem()
get_next_elem()
return root
# Your Codec object will be instantiated and called as such:
# codec = Codec()
# codec.deserialize(codec.serialize(root))