-
Notifications
You must be signed in to change notification settings - Fork 0
/
codecbinarytree.cpp
79 lines (76 loc) · 2.02 KB
/
codecbinarytree.cpp
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
/**
* 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) {
int i, size;
bool first = true;
string ans = "";
queue<TreeNode *> Q;
TreeNode *ptr;
if (root) {
Q.push(root);
ans += to_string(root->val);
while (!Q.empty()) {
size = Q.size();
while (size) {
ptr = Q.front();
Q.pop();
if (ptr) {
Q.push(ptr->left);
Q.push(ptr->right);
if (!first)
ans += "," + to_string(ptr->val);
}
else
ans += "," + to_string(INT_MIN);
size--;
first = false;
}
}
}
return ans;
}
// Decodes your encoded data to tree.
TreeNode* deserialize(string data) {
int num;
vector<int> nodes;
stringstream ss(data);
while (ss >> num) {
nodes.push_back(num);
if (ss.peek() == ',')
ss.ignore();
}
return helper(nodes);
}
TreeNode *helper(vector<int> arr) {
int i = 0;
TreeNode *root = NULL;
queue<reference_wrapper<TreeNode *> > Q;
Q.push(root);
while (i < arr.size()) {
TreeNode *&curr = Q.front();
Q.pop();
if (arr[i] != INT_MIN) {
curr = new TreeNode(arr[i]);
Q.push(curr->left);
Q.push(curr->right);
}
i++;
}
return root;
}
};
/*
Your Codec object will be instantiated and called as such:
Codec codec;
codec.deserialize(codec.serialize(root));
*/