forked from ngiengkianyew/daily-coding-problem
-
Notifications
You must be signed in to change notification settings - Fork 0
/
problem_003.py
59 lines (45 loc) · 1.31 KB
/
problem_003.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
import json
class Node:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
def __repr__(self):
return str(self.data)
def serialize(root):
if not root:
return None
serialized_tree_map = dict()
serialized_left = serialize(root.left)
serialized_right = serialize(root.right)
serialized_tree_map['data'] = root.data
if serialized_left:
serialized_tree_map['left'] = serialized_left
if serialized_right:
serialized_tree_map['right'] = serialized_right
return json.dumps(serialized_tree_map)
def deserialize(s):
serialized_tree_map = json.loads(s)
node = Node(serialized_tree_map['data'])
if 'left' in serialized_tree_map:
node.left = deserialize(serialized_tree_map['left'])
if 'right' in serialized_tree_map:
node.right = deserialize(serialized_tree_map['right'])
return node
node_a = Node('a')
node_b = Node('b')
node_c = Node('c')
node_d = Node('d')
node_e = Node('e')
node_f = Node('f')
node_g = Node('g')
node_a.left = node_b
node_a.right = node_c
node_b.left = node_d
node_b.right = node_e
node_c.left = node_f
node_c.right = node_g
serialized_a = serialize(node_a)
print(serialized_a)
deserialized_a = deserialize(serialized_a)
assert str(deserialized_a) == "a"