-
Notifications
You must be signed in to change notification settings - Fork 1
/
lexicon.cpp
212 lines (196 loc) · 5.03 KB
/
lexicon.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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
class lexicon
{
private:
class Node
{
public:
std::string key;
Node* left=nullptr;
Node* right=nullptr;
int freq=1;
};
Node* root;
public:
lexicon():root(nullptr){}
~lexicon(){purge(root);}
void purge(Node* root)
{
if(root==nullptr)
return;
purge(root->left);
purge(root->right);
delete root;
}
Node* createNode(const std::string &s)
{
Node* newNode = new Node();
newNode->key=s;
newNode->left=newNode->right=nullptr;
newNode->freq = 1;
return newNode;
}
void insert(const std::string &s)
{
if(root==nullptr)
{
root=createNode(s);
}else if(insert(root,s)){}
}
bool insert(Node* t, const std::string &s)
{
if(s<t->key)
{
if(t->left==nullptr)
{
t->left=createNode(s);
return true;
}else
return insert(t->left,s);
}else if(s>t->key)
{
if(t->right==nullptr)
{
t->right=createNode(s);
return true;
}else
return insert(t->right,s);
}else
{
++(t->freq);
return false;
}
}
int lookup(const std::string &s) const
{
return lookup(root,s);
}
Node* minVal(Node* root)
{
Node* temp = root;
while(temp->left!=nullptr)
temp= temp->left;
return temp;
}
void remove(const std::string & s)
{
root=remove(root,s);
}
Node* remove(Node* root, const std::string &s)
{
if(root==nullptr)
return root;
if(s<root->key)
root->left=remove(root->left,s);
else if(s>root->key)
root->right=remove(root->right,s);
else
{
if(root->left==nullptr)
{
Node* temp= root->right;
delete root;
return temp;
}
if(root->right==nullptr)
{
Node* temp = root->left;
delete root;
return temp;
}
Node* temp = minVal(root->left);
root->key=temp->key;
root->freq=temp->freq;
root->left=remove(root->left,temp->key);
}
return root;
}
int lookup(Node* root, const std::string& s) const
{
if(root==nullptr)
return 0;
if(s==root->key)
return root->freq;
else if(s<root->key)
return lookup(root->left,s);
else if(s>root->key)
return lookup(root->right,s);
}
void Inorder()const
{
Inorder(root);
}
void Inorder(Node* root)const
{
if(root==nullptr)
return;
Inorder(root->left);
cout<<root->key<<" "<<root->freq<<endl;
Inorder(root->right);
}
void replace(const string &s1, const string &s2)
{
if(lookup(s1)==0)
return;
else
{
int s1_freq=0;
Node*node_1=search_string(s1);
s1_freq=node_1->freq;
remove(s1);
if(lookup(s2)==0)
{
insert(s2);
search_string(s2)->freq=s1_freq;
}else
search_string(s2)->freq+=s1_freq;
}
}
friend ostream& operator<<(ostream& stream, const lexicon& l)
{
l.Inorder(l.root);
stream<<"";
return stream;
}
Node* search_string(const std::string &s)
{
return search_string(root,s);
}
Node* search_string(Node* root,const std::string &s)
{
if(root==nullptr || s==root->key)
return root;
else if(s<root->key)
return search_string(root->left,s);
else if(s>root->key)
return search_string(root->right,s);
}
int getLevelUtil(Node* root ,const string& data, int level) const
{
if (root == nullptr)
return 0;
if (root -> key == data)
return level;
int downlevel = getLevelUtil(root -> left,
data, level + 1);
if (downlevel != 0)
return downlevel;
downlevel = getLevelUtil(root->right,
data, level + 1);
return downlevel;
}
int depth( const string &s) const
{
return getLevelUtil(root, s, 1);
}
void print()
{
cout<<root->key<<endl;
}
};
#include <iostream>
#include <string>
#include <list>
#include <array>
#include <vector>
#include <algorithm>
using namespace std;