cs202-hw4/TreeNode.cpp at main · HasanAlpCaferoglu/cs202-hw4 · GitHub

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
/*
 * Title: Balanced Search Trees
 * Author: Hasan Alp Caferoglu
 * ID: 22203991
 * Section: 1
 * Assignment: 4
 * Description: TreeHode Implementation File
 */

#include "TreeNode.h"


TreeNode::TreeNode():count(0), height(0), leftChildPtr(nullptr), rightChildPtr(nullptr)
{
}

TreeNode::TreeNode(const string& anItem):count(1), item(anItem), height(1), leftChildPtr(nullptr), rightChildPtr(nullptr)
{
}

TreeNode::~TreeNode()
{
}

// Get-Set Methods

void TreeNode::setItem(const string& anItem){
    item = anItem;
    count = 1;
}

string TreeNode::getItem() const{
    return item;
}

int TreeNode::getCount() const{
    return count;
}

TreeNode* TreeNode::getLeftChildPtr() const{
    return leftChildPtr;
}

TreeNode* TreeNode::getRightChildPtr() const{
    return rightChildPtr;
}

void TreeNode::setLeftChildPtr(TreeNode* leftPtr){
    leftChildPtr = leftPtr;
}

void TreeNode::setRightChildPtr(TreeNode* rightPtr){
    rightChildPtr = rightPtr;
}

int TreeNode::getHeight() const{
    return height;
}

void TreeNode::setHeight(const int newHeight){
    height = newHeight;
}

// Other Member Functions
void TreeNode::increaseCount(){
    count++;
}

bool TreeNode::isLeaf() const{
    if(leftChildPtr == nullptr && rightChildPtr == nullptr)
        return true;
    else;
        return false;
}