Mini-Vi-Editor/ch16-binaryNodeTree-driver.cpp at main · David243/Mini-Vi-Editor · 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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
//Â  Created by Frank M. Carrano and Timothy M. Henry.
//Â  Copyright (c) 2017 Pearson Education, Hoboken, New Jersey.

#include "BinaryNodeTree.h"  // ADT binary tree operations
#include <iostream>
#include <string>


void display(std::string& anItem)
{
    std::cout << "Displaying item - " << anItem << std::endl;
}  // end display

void check(bool success)
{
    if (success)
        std::cout << "Done." << std::endl;
    else
        std::cout << " Entry not in tree." << std::endl;
}  // end check

int main()
{
    auto tree1 = std::make_unique<BinaryNodeTree<std::string>>();

    //   auto tree2Ptr = std::make_shared<BinaryNodeTree<std::string>>("A");
    //   auto tree3Ptr = std::make_shared<BinaryNodeTree<std::string>>("B");
    //   auto tree4Ptr = std::make_unique<BinaryNodeTree<std::string>>("C", tree2Ptr, tree3Ptr);

    std::shared_ptr<BinaryTreeInterface<std::string>> tree2Ptr =
        std::make_shared<BinaryNodeTree<std::string>>("A");
    auto tree3Ptr = std::make_shared<BinaryNodeTree<std::string>>("B");
    auto tree4Ptr = std::make_unique<BinaryNodeTree<std::string>>("C",
        std::dynamic_pointer_cast<BinaryNodeTree<std::string>>(tree2Ptr), tree3Ptr);


    //   std::unique_ptr<BinaryTreeInterface<std::string>> tree1Ptr(new BinaryNodeTree<std::string>>());

    tree1->add("10");
    tree1->add("20");
    tree1->add("30");
    tree1->add("40");
    tree1->add("50");
    tree1->add("60");
    tree1->add("70");
    tree1->add("80");

    std::cout << "Tree 1 Preorder: Should be 10 20 40 70 60 30 50 80\n";
    tree1->preorderTraverse(display);

    std::cout << "Tree 1 Inorder: Should be 70 40 20 60 10 50 30 80\n";
    tree1->inorderTraverse(display);

    std::cout << "Tree 1 Postorder: Should be 70 40 60 20 50 80 30 10\n";
    tree1->postorderTraverse(display);

    std::cout << "Tree 1 height: " << tree1->getHeight() << std::endl;
    std::cout << "Tree 1 number of nodes: " << tree1->getNumberOfNodes() << std::endl;

    std::cout << "Remove the leaf 80: ";
    bool success = tree1->remove("80");
    check(success);

    std::cout << "Try to remove the leaf 80 again: ";
    success = tree1->remove("80");
    check(success);

    std::cout << "Remove the leaf 50: ";
    success = tree1->remove("50");
    check(success);

    std::cout << "Tree 1 Preorder: Should be 10 20 40 70 60 30\n";
    tree1->preorderTraverse(display);

    std::cout << "Tree 1 Inorder: Should be 70 40 20 60 10 30\n";
    tree1->inorderTraverse(display);

    std::cout << "Tree 1 Postorder: Should be 70 40 60 20 30 10\n";
    tree1->postorderTraverse(display);

    std::cout << "Tree 1 height: " << tree1->getHeight() << std::endl;
    std::cout << "Tree 1 number of nodes: " << tree1->getNumberOfNodes() << std::endl;

    std::cout << "Remove the node 40 that has only a left child: ";
    success = tree1->remove("40");
    check(success);

    std::cout << "Tree 1 Preorder: Should be 10 20 70 60 30\n";
    tree1->preorderTraverse(display);

    std::cout << "Tree 1 Inorder: Should be 70 20 60 10 30\n";
    tree1->inorderTraverse(display);

    std::cout << "Tree 1 Postorder: Should be 70 60 20 30 10\n";
    tree1->postorderTraverse(display);

    std::cout << "Tree 1 height: " << tree1->getHeight() << std::endl;
    std::cout << "Tree 1 number of nodes: " << tree1->getNumberOfNodes() << std::endl;

    std::cout << "Remove the root 10 that has both left and right subtrees: ";
    success = tree1->remove("10");
    check(success);

    std::cout << "Tree 1 Preorder: Should be 20 60 70 30\n";
    tree1->preorderTraverse(display);

    std::cout << "Tree 1 Inorder: Should be 70 60 20 30\n";
    tree1->inorderTraverse(display);

    std::cout << "Tree 1 Postorder: Should be 70 60 30 20\n";
    tree1->postorderTraverse(display);

    std::cout << "Tree 1 height: " << tree1->getHeight() << std::endl;
    std::cout << "Tree 1 number of nodes: " << tree1->getNumberOfNodes() << std::endl;

    return 0;
}  // end main
/*
 Tree 1 Preorder: Should be 10 20 40 70 60 30 50 80
 Displaying item - 10
 Displaying item - 20
 Displaying item - 40
 Displaying item - 70
 Displaying item - 60
 Displaying item - 30
 Displaying item - 50
 Displaying item - 80
 Tree 1 Inorder: Should be 70 40 20 60 10 50 30 80
 Displaying item - 70
 Displaying item - 40
 Displaying item - 20
 Displaying item - 60
 Displaying item - 10
 Displaying item - 50
 Displaying item - 30
 Displaying item - 80
 Tree 1 Postorder: Should be 70 40 60 20 50 80 30 10
 Displaying item - 70
 Displaying item - 40
 Displaying item - 60
 Displaying item - 20
 Displaying item - 50
 Displaying item - 80
 Displaying item - 30
 Displaying item - 10
 Tree 1 height: 4
 Tree 1 number of nodes: 8
 Remove the leaf 80: Done.
 Try to remove the leaf 80 again:  Entry not in tree.
 Remove the leaf 50: Done.
 Tree 1 Preorder: Should be 10 20 40 70 60 30
 Displaying item - 10
 Displaying item - 20
 Displaying item - 40
 Displaying item - 70
 Displaying item - 60
 Displaying item - 30
 Tree 1 Inorder: Should be 70 40 20 60 10 30
 Displaying item - 70
 Displaying item - 40
 Displaying item - 20
 Displaying item - 60
 Displaying item - 10
 Displaying item - 30
 Tree 1 Postorder: Should be 70 40 60 20 30 10
 Displaying item - 70
 Displaying item - 40
 Displaying item - 60
 Displaying item - 20
 Displaying item - 30
 Displaying item - 10
 Tree 1 height: 4
 Tree 1 number of nodes: 6
 Remove the node 40 that has only a left child: Done.
 Tree 1 Preorder: Should be 10 20 70 60 30
 Displaying item - 10
 Displaying item - 20
 Displaying item - 70
 Displaying item - 60
 Displaying item - 30
 Tree 1 Inorder: Should be 70 20 60 10 30
 Displaying item - 70
 Displaying item - 20
 Displaying item - 60
 Displaying item - 10
 Displaying item - 30
 Tree 1 Postorder: Should be 70 60 20 30 10
 Displaying item - 70
 Displaying item - 60
 Displaying item - 20
 Displaying item - 30
 Displaying item - 10
 Tree 1 height: 3
 Tree 1 number of nodes: 5
 Remove the root 10 that has both left and right subtrees: Done.
 Tree 1 Preorder: Should be 20 60 70 30
 Displaying item - 20
 Displaying item - 60
 Displaying item - 70
 Displaying item - 30
 Tree 1 Inorder: Should be 70 60 20 30
 Displaying item - 70
 Displaying item - 60
 Displaying item - 20
 Displaying item - 30
 Tree 1 Postorder: Should be 70 60 30 20
 Displaying item - 70
 Displaying item - 60
 Displaying item - 30
 Displaying item - 20
 Tree 1 height: 3
 Tree 1 number of nodes: 4
 */