-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path#3.cpp
149 lines (132 loc) · 2.84 KB
/
#3.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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
/*
Good morning! Here's your coding interview problem for today.
This problem was asked by Google.
Given the root to a binary tree, implement serialize(root), which serializes the tree into a string,
and deserialize(s), which deserializes the string back into the tree.
*/
#include <bits/stdc++.h>
using namespace std;
class Node
{
public:
int data;
Node *left;
Node *right;
};
// Function to create node in a binary tree
Node* createNode(int data){
Node* node = new Node();
node -> data = data;
node -> left = node -> right = NULL;
return node;
}
// Function to insert a node in a given binary tree;
void insert(Node* *root, int data)
{
if (!(*root))
{
*root = createNode(data);
return;
}
else
{
queue<Node *> q;
q.push(*root);
while (!q.empty())
{
Node *temp = q.front();
q.pop();
if (temp->left)
q.push(temp->left);
else
{
temp->left = createNode(data);
return;
}
if (temp->right)
q.push(temp->right);
else
{
temp->right = createNode(data);
return;
}
}
}
}
void preorder(Node *root)
{
if (!root)
return;
cout << root->data << " ";
preorder(root->left);
preorder(root->right);
}
void inOrder(Node *root)
{
if (!root)
return;
inOrder(root->left);
cout << root->data << " ";
inOrder(root->right);
}
void postOrder(Node *root)
{
if (!root)
return;
postOrder(root->left);
postOrder(root->right);
cout << root->data << " ";
}
void levelOrder(Node *root)
{
queue<Node *> q;
q.push(root);
while (!q.empty())
{
Node *temp = q.front();
q.pop();
cout << temp->data << " ";
if (temp->left)
q.push(temp->left);
if (temp->right)
q.push(temp->right);
}
}
string serialize(Node* root){
queue<Node* > q;
q.push(root);
string ans = "";
while(q.empty() == false){
Node* temp = q.front();
q.pop();
ans += to_string(temp -> data);
if(temp -> left) q.push(temp -> left);
if(temp -> right) q.push(temp -> right);
}
return ans;
}
Node* deserialize(string str){
Node* root = NULL;
int n = str.length();
for(int i = 0; i < n; i++){
insert(&root, (str[i] - '0'));
}
return root;
}
int main()
{
Node *root = NULL;
insert(&root, 1);
insert(&root, 2);
insert(&root, 3);
insert(&root, 4);
insert(&root, 5);
preorder(root);
cout << endl;
levelOrder(root);
cout << endl;
cout << serialize(root) << endl;
Node* decoded_tree = deserialize(serialize(root));
levelOrder(decoded_tree);
return 0;
}