DS_Project_v2/NameBST.cpp at master · cjs1004ounds/DS_Project_v2 · 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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#include "NameBST.h"
#include <iostream>
#include <string>

using namespace std;

NameBST::NameBST() : root(nullptr)
{

}

NameBST::~NameBST()
{
    if (root != nullptr)
    {
        deleteSubtree(root);
    }
}

NameBSTNode* NameBST::getRoot() const
{
    return root;
}

void NameBST::insert(const string& name, int age, const string& collectionDate, const string& expirationDate, const string& termsType)
{
    root = insertRec(root, name, age, collectionDate, expirationDate, termsType);
}

NameBSTNode* NameBST::insertRec(NameBSTNode* node, const string& name, int age, const string& collectionDate, const string& expirationDate, const string& termsType)
{
    if (node == nullptr)
    {
        return new NameBSTNode(name, age, collectionDate, expirationDate, termsType);
    }

    if (name < node->getMemberName())
    {
        node->setLeft(insertRec(node->getLeft(), name, age, collectionDate, expirationDate, termsType));
    }
    else if (name > node->getMemberName())
    {
        node->setRight(insertRec(node->getRight(), name, age, collectionDate, expirationDate, termsType));
    }

    return node;
}

NameBSTNode* NameBST::search(const string& name) const
{
    return searchRec(root, name);
}

NameBSTNode* NameBST::searchRec(NameBSTNode* node, const string& name) const
{
    if (node == nullptr || node->getMemberName() == name)
    {
        return node;
    }

    if (name < node->getMemberName())
    {
        return searchRec(node->getLeft(), name);
    }

    return searchRec(node->getRight(), name);
}

void NameBST::printInOrder(NameBSTNode* node) const
    {
    if (node != nullptr)
    {
        printInOrder(node->getLeft());
        cout << "Name: " << node->getMemberName() << ", Age: " << node->getAge()
            << ", Collection Date: " << node->getCollectionDate()
            << ", Expiration Date: " << node->getExpirationDate()
            << ", Terms Type: " << node->getTermsType() << endl;
        printInOrder(node->getRight());
    }
}

void NameBST::deleteNode(const string& name, TermsBST& termsBST)
{
    root = deleteRec(root, name, termsBST);
}

NameBSTNode* NameBST::deleteRec(NameBSTNode* node, const string& name, TermsBST& termsBST)
{
    if (node == nullptr)
        return node;

    if (name < node->getMemberName())
    {
        node->setLeft(deleteRec(node->getLeft(), name, termsBST));
    }
    else if (name > node->getMemberName())
    {
        node->setRight(deleteRec(node->getRight(), name, termsBST));
    }
    else
    {
        if (node->getLeft() == nullptr)
        {
            NameBSTNode* temp = node->getRight();
            delete node;
            return temp;
        }
        else if (node->getRight() == nullptr)
        {
            NameBSTNode* temp = node->getLeft();
            delete node;
            return temp;
        }

        NameBSTNode* temp = minValueNode(node->getRight());
        node->setMemberName(temp->getMemberName());
        node->setAge(temp->getAge());
        node->setCollectionDate(temp->getCollectionDate());
        node->setExpirationDate(temp->getExpirationDate());
        node->setTermsType(temp->getTermsType());
        node->setRight(deleteRec(node->getRight(), temp->getMemberName(), termsBST));

        termsBST.deleteNode(name);
    }
    return node;
}

NameBSTNode* NameBST::minValueNode(NameBSTNode* node)
{
    NameBSTNode* current = node;
    while (current && current->getLeft() != nullptr)
    {
        current = current->getLeft();
    }
    return current;
}

void NameBST::deleteSubtree(NameBSTNode* node)
{
    if (node == nullptr)
        return;

    deleteSubtree(node->getLeft());
    deleteSubtree(node->getRight());

    delete node;
}

NameBSTNode* NameBST::deleteByName(const string& name, TermsBST& termsBST) {
    return nullptr;
}