blob: 27d49ccec60e4c67968f560122429de33ba6c214 (
plain)
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
|
/***************************************************************************
* Copyright (C) 2004-2005 by Daniel Clarke *
* daniel.jc@gmail.com *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program 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 General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#include "btreenode.h"
#include "pic14.h"
BTreeNode::BTreeNode()
{
m_parent = 0L;
m_left = 0L;
m_right = 0L;
m_type = unset;
}
BTreeNode::BTreeNode(BTreeNode *p, BTreeNode *l, BTreeNode *r)
{
m_parent = p;
m_left = l;
m_right = r;
}
BTreeNode::~BTreeNode()
{
// Must not delete children as might be unlinking!!! deleteChildren();
}
void BTreeNode::deleteChildren()
{
if(m_left)
{
m_left->deleteChildren();
delete m_left;
}
if(m_right)
{
m_right->deleteChildren();
delete m_right;
}
m_left = 0L;
m_right = 0L;
return;
}
// void BTreeNode::printTree()
// {
//
// }
|
