-
Notifications
You must be signed in to change notification settings - Fork 27
/
Serialize and Deserialize Binary Tree
73 lines (69 loc) · 1.96 KB
/
Serialize and Deserialize Binary Tree
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
/**
* 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 "";
string s="";
queue<TreeNode*> q;
q.push(root);
while(!q.empty()){
TreeNode* node=q.front();
q.pop();
if(node==NULL) s.append("#,");
else s.append(to_string(node->val)+',');
if(node!=NULL){
q.push(node->left);
q.push(node->right);
}
}
return s;
}
// Decodes your encoded data to tree.
TreeNode* deserialize(string data) {
if(data.size()==0) return NULL;
stringstream s(data);
string str;
getline(s,str,','); // this will store the number in string format
TreeNode* root=new TreeNode(stoi(str));
queue<TreeNode*> q;
q.push(root);
while(!q.empty()){
TreeNode* node=q.front();
q.pop();
getline(s,str,',');
if(str=="#"){
node->left=NULL;
}
else{
TreeNode* left=new TreeNode(stoi(str));
node->left=left;
q.push(left);
}
getline(s,str,',');
if(str=="#"){
node->right=NULL;
}
else{
TreeNode* right=new TreeNode(stoi(str));
node->right=right;
q.push(right);
}
}
return root;
}
};
// Your Codec object will be instantiated and called as such:
// Codec ser, deser;
// TreeNode* ans = deser.deserialize(ser.serialize(root));
// Your Codec object will be instantiated and called as such:
// Codec ser, deser;
// TreeNode* ans = deser.deserialize(ser.serialize(root));