dhps-lib/binarytree.c at main · DHPS-Solutions/dhps-lib · 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
#include <stdlib.h>
#include <stdbool.h>

#include "binarytree.h"

void init_tree(struct tree_t *tree)
{
    tree->root = NULL;
}

struct tree_node_t *create_tree_node(void *data, free_fn_t *free_func)
{
    struct tree_node_t *new_node = (struct tree_node_t *)
                                    (malloc(sizeof(struct tree_node_t)));
    new_node->data = data;
    new_node->free_func = free_func;
    new_node->left = NULL;
    new_node->right = NULL;
    new_node->parent = NULL;
    return new_node;
}

void insert_tree_node(struct tree_t *tree, void *data, compare_fn_t cmp, free_fn_t *free_func)
{
    struct tree_node_t *new_node = create_tree_node(data, free_func);

    if (!tree->root) {
        tree->root = new_node;
    } else {
        struct tree_node_t *current = tree->root;
        struct tree_node_t *parent = NULL;
        while (current) {
            parent = current;
            if (cmp(data, current->data)) {
                current = current->left;
            } else {
                current = current->right;
            }
        }
        if (cmp(data, parent->data)) {
            parent->left = new_node;
        } else {
            parent->right = new_node;
        }
        new_node->parent = parent;
    }
}

struct tree_node_t *find_tree_node(struct tree_t *tree, void *data, compare_fn_t cmp)
{
    struct tree_node_t *current = tree->root;
    while (current) {
        if (cmp(data, current->data)) {
            current = current->left;
        } else if (cmp(current->data, data)) {
            current = current->right;
        } else {
            return current;
        }
    }
    return NULL;
}

size_t find_height(struct tree_node_t *node)
{
    if (!node) {
        return 0;
    } else {
        int left_height = find_height(node->left);
        int right_height = find_height(node->right);
        if (left_height >= right_height) return left_height + 1;
        else return right_height +1;
    }
}

size_t find_height_tree(struct tree_t *tree_t)
{
    return find_height(tree_t->root);
}

bool remove_tree_node(struct tree_t *tree, void *data, compare_fn_t cmp)
{
    struct tree_node_t *current = tree->root;
    while (current) {
        if (cmp(data, current->data)) {
            current = current->left;
        } else if (cmp(current->data, data)) {
            current = current->right;
        } else {
            break;
        }
    }

    if (!current)
        return false;

    if (!current->left && !current->right) {
        if (current == tree->root) {
            tree->root = NULL;
        } else {
            if (current->parent->left == current) {
                current->parent->left = NULL;
            } else {
                current->parent->right = NULL;
            }
        }
        free_tree_node(current);
    } else if (!current->left || !current->right) {
        struct tree_node_t *child = current->left ? current->left : current->right;
        if (current == tree->root) {
            tree->root = child;
        } else {
            if (current->parent->left == current) {
                current->parent->left = child;
            } else {
                current->parent->right = child;
            }
        }
        child->parent = current->parent;
        free_tree_node(current);
    } else {
        struct tree_node_t *successor = current->right;
        while (successor->left) {
            successor = successor->left;
        }
        current->data = successor->data;
        if (successor->parent->left == successor) {
            successor->parent->left = successor->right;
        } else {
            successor->parent->right = successor->right;
        }
        if (successor->right) {
            successor->right->parent = successor->parent;
        }
        free_tree_node(successor);
    }
    return true;
}

void free_tree_node(struct tree_node_t *node)
{
    if (node) {
        free_tree_node(node->left);
        free_tree_node(node->right);
        node->free_func(node->data);
        free(node);
    }
}

void free_tree(struct tree_t *tree)
{
    free_tree_node(tree->root);
}