-
Notifications
You must be signed in to change notification settings - Fork 1
/
main.c
76 lines (57 loc) · 1.01 KB
/
main.c
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
#include <stdio.h>
#include "skip_tree.h"
#define SIZE 15
void print_ps(int key) {
printf("Node %d: Predecessor: %d Sucessor: %d\n", key, predecessor(key), successor(key));
}
void print_pss(){
for(int i = 0; i < SIZE; i++)
{
if(contains(i))
{
print_ps(i);
}
}
}
int main()
{
int x;
init(SIZE);
print_stree();
print_dtree();
insert(1, &x);
print_dtree();
print_pss();
insert(2, &x);
print_dtree();
print_pss();
insert(3, &x);
print_dtree();
print_pss();
erase(3);
print_dtree();
print_pss();
insert(4, &x);
print_dtree();
print_pss();
erase(1);
print_dtree();
print_pss();
insert(4, &x);
print_dtree();
print_pss();
erase(2);
print_dtree();
print_pss();
insert(5, &x);
print_dtree();
print_pss();
insert(11, &x);
print_dtree();
print_pss();
erase(11);
print_dtree();
print_pss();
destroy();
return 0;
}