-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathParentNode.cpp
40 lines (35 loc) · 1.08 KB
/
ParentNode.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
/*
* File: ParentNode.cpp
* Author: Babu
*
* Created on 20. říjen 2012, 21:31
*/
#include "ParentNode.h"
#include "LeafNode.h"
ParentNode::ParentNode( int maxHammWeight, int level, bool value) : Node(maxHammWeight, level, value) {
this->isLeaf = false;
}
ParentNode::~ParentNode() {
}
Node* ParentNode::makeRightFalseNode() {
Node * n;
int childMaxHammWeight = maxHammWeight - 1;
int childLevel=level-1;
if (childLevel==1 ) {//we make it at the last level so we now need the leafs
n = new LeafNode(childMaxHammWeight, childLevel, false);
} else {
n = new ParentNode(childMaxHammWeight, childLevel, false);
}
return n;
}
Node* ParentNode::makeLeftTrueNode() {
Node * n;
int childMaxHammWeight = maxHammWeight;
int childLevel=level-1;
if (childLevel==1) {//we make it at the last level so we now need the leafs
n = new LeafNode(childMaxHammWeight, childLevel, true);
} else {
n = new ParentNode(childMaxHammWeight, childLevel, true);
}
return n;
}