forked from dragonslayerv2/Competitive-Programming
/
trees.cpp
77 lines (67 loc) · 943 Bytes
/
trees.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
#include<vector>
#include<list>
#include<iostream>
using namespace std;
class tree
{
public:
typedef int value_type;
class node
{
int _parent;
value_type _data;
list<size_t> _children;
public:
node()
{
parent=-1;
}
size_t parent() const
{
return _parent;
}
const list<size_t> &children() const
{
return _children;
}
operator value_type&()
{
return _data;
}
void make_parent(node &child)
{
_children.push_back(child);
}
};
private:
vector<node> nodes;
public:
tree()
{}
tree(size_t size)
{
assign(size);
}
void assign(size_t size)
{
clear();
nodes.resize(size);
for(int i=0;i<nodes.size();i++)
nodes[i];
}
node &operator[](size_t pos)
{
return node[pos];
}
void clear()
{
nodes.clear();
}
~tree()
{
clear();
}
};
int main()
{
}