-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path297.serialize-and-deserialize-binary-tree.cpp
More file actions
81 lines (76 loc) · 2.11 KB
/
297.serialize-and-deserialize-binary-tree.cpp
File metadata and controls
81 lines (76 loc) · 2.11 KB
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
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Codec {
public:
// Encodes a tree to a single string.
string serialize(TreeNode* root) {
if(!root)
return "x";
string x = to_string(root->val) + "(" + serialize(root->left) + ")(" + serialize(root->right) + ")";
// cout<<x<<endl;
return x;
}
// Decodes your encoded data to tree.
TreeNode* deserialize(string data) {
if(data == "x")
return NULL;
int start = 0;
int end = data.find("(");
int number;
try{
number = stoi(data.substr(start, end - start));
}catch(...)
{
return NULL;
}
TreeNode* n = new TreeNode(number);
cout<<"Data "<<data<<endl;
start = end+1;
int count = 0;
for(int i=end; i<data.length(); i++)
{
if(data[i] == '(')
count++;
else if(data[i] == ')')
{
count--;
if(!count)
{
end = i + 1;
break;
}
}
}
cout<<"Left data : "<<data.substr(start, end - start)<<endl;
n->left = deserialize(data.substr(start, end - start));
start = end+1;
count = 0;
for(int i=end; i<data.length(); i++)
{
if(data[i] == '(')
count++;
else if(data[i] == ')')
{
count--;
if(!count)
{
end = i;
break;
}
}
}
cout<<"Right data: "<<data.substr(start, end - start)<<endl;
n->right = deserialize(data.substr(start, end - start));
return n;
}
};
// Your Codec object will be instantiated and called as such:
// Codec ser, deser;
// TreeNode* ans = deser.deserialize(ser.serialize(root));