-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTreeTest.cpp
144 lines (131 loc) · 4.16 KB
/
TreeTest.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
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
/**
* Examples of automatic tests for the exercise on binary trees.
*
* @author Erel Segal-Halevi
* @since 2019-02
*/
#include <iostream>
using std::cout, std::endl;
#include "badkan.hpp"
#include "Tree.hpp"
int main() {
//init tree objects
ariel::Tree emptytree;
ariel::Tree threetree;
ariel::Tree fivetree;
ariel::Tree sixtree;
ariel::Tree tentree;
ariel::Tree diagtree;
ariel::Tree mytree;
//creating a tree size 3
threetree.insert(5);
threetree.insert(7);
threetree.insert(3);
badkan::TestCase tc("Binary tree");
tc
//some empty tree tests
.CHECK_EQUAL (emptytree.size(), 0)
.CHECK_OK (emptytree.insert(5))
.CHECK_EQUAL (emptytree.size(), 1)
.CHECK_EQUAL (emptytree.contains(5), true)
.CHECK_OK (emptytree.remove(5))
.CHECK_EQUAL (emptytree.contains(5), false)
.CHECK_THROWS(emptytree.remove(5))
.CHECK_EQUAL (emptytree.size() ,0)
//tree size 3 tests
.CHECK_THROWS (threetree.parent(5))
.CHECK_EQUAL (threetree.parent(7), 5)
.CHECK_EQUAL (threetree.size(), 3)
.CHECK_EQUAL (threetree.root(), 5)
.CHECK_EQUAL (threetree.parent(3), 5)
.CHECK_EQUAL (threetree.parent(7), 5)
.CHECK_EQUAL (threetree.left(5), 3)
.CHECK_EQUAL (threetree.right(5), 7)
.CHECK_THROWS(threetree.insert(3))
.CHECK_THROWS(threetree.left(6))
.CHECK_OK (threetree.print())
//creating a tree size 5
.CHECK_OK(fivetree.insert(10))
.CHECK_OK(fivetree.insert(13))
.CHECK_OK(fivetree.insert(8))
.CHECK_OK(fivetree.insert(22))
.CHECK_OK(fivetree.insert(12))
.CHECK_EQUAL(fivetree.size(),5)
.CHECK_OK(fivetree.remove(8))
//check contains function after remove function
.CHECK_EQUAL(fivetree.contains(8),false)
//check remove node that already removed
.CHECK_THROWS(fivetree.remove(8))
.CHECK_EQUAL (fivetree.root(), 10)
.CHECK_OK (fivetree.print())
//creating a tree size 6
.CHECK_OK(sixtree.insert(60))
.CHECK_OK(sixtree.insert(49))
.CHECK_OK(sixtree.insert(2))
.CHECK_OK(sixtree.insert(70))
.CHECK_OK(sixtree.insert(1))
.CHECK_OK(sixtree.insert(10))
.CHECK_EQUAL(sixtree.size(),6)
.CHECK_OK(sixtree.remove(60))
.CHECK_EQUAL(sixtree.root(),70)
.CHECK_EQUAL(sixtree.size(),5)
.CHECK_EQUAL(sixtree.left(70),49)
.CHECK_OK (sixtree.print())
//creating a tree size 10
.CHECK_OK(tentree.insert(42))
.CHECK_OK(tentree.insert(4))
.CHECK_OK(tentree.insert(100))
.CHECK_OK(tentree.insert(34))
.CHECK_OK(tentree.insert(12))
.CHECK_THROWS(tentree.insert(12))
.CHECK_OK(tentree.insert(11))
.CHECK_OK(tentree.insert(-5))
.CHECK_OK(tentree.insert(7))
.CHECK_OK(tentree.insert(85))
.CHECK_OK(tentree.insert(53))
.CHECK_OK(tentree.remove(4))
//test correctness for binary tree
.CHECK_EQUAL(tentree.right(7),34)
.CHECK_OK(tentree.remove(42))
.CHECK_EQUAL (tentree.parent(12),34)
.CHECK_EQUAL(tentree.root(),53)
//check size function after to delete function calls
.CHECK_EQUAL(tentree.size(),8)
.CHECK_OK (tentree.print())
//creating a diagonal shape
.CHECK_OK(diagtree.insert(0))
.CHECK_OK(diagtree.insert(-1))
.CHECK_OK(diagtree.insert(-2))
.CHECK_OK(diagtree.insert(-4))
//check correctness for diagonal shape
.CHECK_THROWS (diagtree.right(0))
.CHECK_THROWS (diagtree.right(-1))
.CHECK_THROWS (diagtree.right(-2))
.CHECK_THROWS (diagtree.right(-4))
.CHECK_EQUAL(diagtree.left(0),-1)
.CHECK_EQUAL(diagtree.left(-1),-2)
.CHECK_EQUAL(diagtree.left(-2),-4)
.CHECK_THROWS(diagtree.left(-4))
//print diagonal shape
.CHECK_OK (diagtree.print())
//empty the tree and check size
.CHECK_OK(diagtree.remove(-4))
.CHECK_OK(diagtree.remove(-2))
.CHECK_OK(diagtree.remove(-1))
.CHECK_OK(diagtree.remove(0))
.CHECK_EQUAL(diagtree.size(),0);
//some automatic tests for tree size 100
for(int i = 1; i<=100; i++){
tc
.CHECK_EQUAL (mytree.contains(i),false)
.CHECK_OK (mytree.insert(i))
.CHECK_EQUAL(mytree.size(),i)
.CHECK_EQUAL (mytree.contains(i),true)
.CHECK_OK (mytree.remove(i))
.CHECK_EQUAL(mytree.size(),i-1)
.CHECK_EQUAL (mytree.contains(i),false)
.CHECK_OK (mytree.insert(i));
}
tc.print();
cout << "You have " << tc.right() << " right answers and " << tc.wrong() << " wrong answers so your grade is " << tc.grade() << ". Great!" << endl;
}