-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtree_node.hh
221 lines (178 loc) · 3.9 KB
/
tree_node.hh
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
213
214
215
216
217
218
219
220
221
/**
* @file node.h
* @brief Clasa TreeNode memoreaza datele(parintele, copiii si cheia) unui nod din arbore;
* @version 0.1
* @date 2021-04-23
*
* @copyright Copyright (c) 2021
*
*/
#ifndef NODE_HH
#define NODE_HH
#include <ostream>
#include <istream>
template <class T>
class TreeNode
{
protected:
TreeNode *p; // parintele nodului;
TreeNode *left; // copilul stang;
TreeNode *right; // copilul drept;
size_t count; // de cate ori se repeta cheia in multime;
T key; // cheia nodului;
public:
TreeNode();
TreeNode(T x);
TreeNode(const TreeNode &node);
virtual ~TreeNode();
void inc_count();
void dec_count();
size_t get_count() const;
// returneaza nodul parinte;
const TreeNode<T> *get_parent() const;
// returneaza copilul stang;
const TreeNode<T> *get_left() const;
// returneaza copilul drept;
const TreeNode<T> *get_right() const;
// seteaza parintele;
void set_parent(const TreeNode<T> *node);
// seteaza copilul stang;
void set_left(const TreeNode<T> *node);
// seteaza copilul drept;
void set_right(const TreeNode<T> *node);
// returneaza cheia nodului;
T get_key() const;
// seteaza cheia nodului;
void set_key(T key);
TreeNode<T> &operator=(const TreeNode<T> &node);
TreeNode<T> &operator=(T key);
operator T() const;
template <class t>
friend std::ostream &operator<<(std::ostream &out, const TreeNode<t> &node);
template <class t>
friend std::istream &operator>>(std::istream &in, TreeNode<t> &node);
};
template <class T>
TreeNode<T>::TreeNode()
{
this->p = nullptr;
this->left = nullptr;
this->right = nullptr;
this->count = 1;
}
template <class T>
TreeNode<T>::TreeNode(T key)
{
this->p = nullptr;
this->left = nullptr;
this->right = nullptr;
this->count = 1;
this->key = key;
}
template <class T>
TreeNode<T>::TreeNode(const TreeNode<T> &node)
{
this->p = node.p;
this->left = node.left;
this->right = node.right;
this->key = node.key;
this->count = node.count;
}
template <class T>
TreeNode<T>::~TreeNode() {}
template <class T>
void TreeNode<T>::inc_count()
{
this->count++;
}
template <class T>
void TreeNode<T>::dec_count()
{
this->count--;
}
template <class T>
size_t TreeNode<T>::get_count() const
{
return this->count;
}
template <class T>
const TreeNode<T> *TreeNode<T>::get_parent() const
{
return this->p;
}
template <class T>
const TreeNode<T> *TreeNode<T>::get_left() const
{
return this->left;
}
template <class T>
const TreeNode<T> *TreeNode<T>::get_right() const
{
return this->right;
}
template <class T>
void TreeNode<T>::set_parent(const TreeNode<T> *node)
{
this->p = (TreeNode *)node;
}
template <class T>
void TreeNode<T>::set_left(const TreeNode<T> *node)
{
this->left = (TreeNode *)node;
}
template <class T>
void TreeNode<T>::set_right(const TreeNode<T> *node)
{
this->right = (TreeNode *)node;
}
template <class T>
T TreeNode<T>::get_key() const
{
return this->key;
}
template <class T>
void TreeNode<T>::set_key(T x)
{
this->key = key;
}
template <class T>
TreeNode<T>::operator T() const
{
return this->key;
}
template <class T>
TreeNode<T> &TreeNode<T>::operator=(const TreeNode<T> &node)
{
if (this != &node)
{
this->p = node.p;
this->left = node.left;
this->right = node.right;
this->key = node.key;
}
return *this;
}
template <class T>
TreeNode<T> &TreeNode<T>::operator=(T x)
{
this->p = nullptr;
this->left = nullptr;
this->right = nullptr;
this->key = x;
return *this;
}
template <class t>
std::ostream &operator<<(std::ostream &out, const TreeNode<t> &node)
{
out << node.get_key();
return out;
}
template <class t>
std::istream &operator>>(std::istream &in, TreeNode<t> &node)
{
int x;
in >> x;
node.set_key(x);
return in;
}
#endif