-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathtree.h
74 lines (56 loc) · 1.66 KB
/
tree.h
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
#ifndef CPP_TREE_H
#define CPP_TREE_H
#include "list.h"
namespace tree {
template <class base_type, class tree_data_type>
struct node {
virtual list<node*>* tree() { return 0; };
virtual list<node*>* tree(tree_data_type& data) { return 0; };
virtual base_type* content() = 0;
virtual void content(const base_type& src) = 0;
virtual ~node() {};
};
template <class base_type, class tree_data_type>
class leaf : public node<base_type, tree_data_type> {
base_type m_content;
public:
leaf() : m_content() {};
virtual base_type* content() { return &m_content; };
virtual void content(const base_type& src) { m_content = src; };
};
template <class base_type, class tree_data_type>
class tree_node : public node<base_type, tree_data_type> {
typedef node<base_type, tree_data_type> node_type;
typedef list<node_type*> node_list;
node_list *m_head;
tree_data_type m_data;
public:
tree_node() : m_head(0), m_data() {};
template <class init_type>
tree_node(const init_type& init_val) : m_head(0), m_data(init_val) {};
~tree_node()
{
node_list *n;
for (node_list *p = m_head; p; p = n)
{
n = p->next();
delete p->content();
delete p;
}
};
virtual node_list* tree() { return m_head; };
virtual node_list* tree(tree_data_type& data)
{
data = m_data;
return m_head;
};
virtual base_type* content() { return 0; };
virtual void content(const base_type& src) { };
void add(node_type* child)
{
node_list *t = new node_list(child);
m_head = node_list::push_back(m_head, t);
}
};
}
#endif