B-Tree/main.c at main · raulciure/B-Tree · 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
#include "B-Tree.h"
#include <stdlib.h>
#include <stdio.h>


int main()
{
    Node* tree = NULL;

    printf("Hello from program!\n\n");

    // Add nodes
    tree = treeAdd(tree, 10);
    tree = treeAdd(tree, 7);
    tree = treeAdd(tree, 70);
    tree = treeAdd(tree, 55);
    tree = treeAdd(tree, 69);
    tree = treeAdd(tree, 80);
    tree = treeAdd(tree, 101);
    tree = treeAdd(tree, 1);
    tree = treeAdd(tree, 5);
    tree = treeAdd(tree, 9);
    tree = treeAdd(tree, 22);
    tree = treeAdd(tree, 23);
    tree = treeAdd(tree, 98);
    tree = treeAdd(tree, 66);
    tree = treeAdd(tree, 12);
    tree = treeAdd(tree, 14);
    tree = treeAdd(tree, 16);
    tree = treeAdd(tree, 67);
    tree = treeAdd(tree, 19);
    tree = treeAdd(tree, 20);
    tree = treeAdd(tree, 71);

    tree = treeAdd(tree, 44);
    tree = treeAdd(tree, 45);
    tree = treeAdd(tree, 46);
    tree = treeAdd(tree, 72);
    tree = treeAdd(tree, 73);
    tree = treeAdd(tree, 74);
    tree = treeAdd(tree, 75);

    // Traverse node
    treeTraverse(tree);

    // Search node
    Node* searchedNode = treeFind(tree, 70);
    listIntPrint(searchedNode->keys);

    printf("Delete tests below\n\n");

    // tree = treeRemove(tree, NULL, 19);

    tree = treeRemove(tree, NULL, 70);
    tree = treeRemove(tree, NULL, 9);
    tree = treeRemove(tree, NULL, 55);
    tree = treeRemove(tree, NULL, 7);
    tree = treeRemove(tree, NULL, 5);
    tree = treeRemove(tree, NULL, 101);

    // Traverse node
    treeTraverse(tree);

    return 0;
}