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
|
/* This file is part of the FaCT++ DL reasoner
Copyright (C) 2003-2015 Dmitry Tsarkov and The University of Manchester
Copyright (C) 2015-2016 Dmitry Tsarkov
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef TSTTREE_H
#define TSTTREE_H
#include <cstdlib> // NULL
//#include "SmallObj.h"
template < class T >
class TsTTree//: public Loki::SmallObject<>
{
private: // members
/// element in the tree node
T elem;
/// pointer to left subtree
TsTTree *left;
/// pointer to right subtree
TsTTree *right;
private: // prevent copy
/// no copy c'tor
TsTTree ( const TsTTree& );
/// no assignment
TsTTree& operator = ( const TsTTree& );
public: // interface
/// default c'tor
TsTTree ( const T& Init, TsTTree *l = NULL, TsTTree *r = NULL )
: elem(Init)
, left(l)
, right(r)
{}
/// d'tor
~TsTTree ( void ) {}
// access to members
T& Element ( void ) { return elem; }
const T& Element ( void ) const { return elem; }
TsTTree* Left ( void ) const { return left; }
TsTTree* Right ( void ) const { return right; }
void SetLeft ( TsTTree *l ) { left = l; }
void SetRight ( TsTTree *r ) { right = r; }
TsTTree* clone ( void ) const
{
TsTTree* p = new TsTTree(Element());
if ( left )
p->SetLeft(left->clone());
if ( right )
p->SetRight(right->clone());
return p;
}
}; // TsTTree
/// delete the whole tree
template <class T>
void deleteTree ( TsTTree<T>* t )
{
if ( t )
{
deleteTree(t->Left());
deleteTree(t->Right());
delete t;
}
}
#endif
|
