/
btree_functions.c
86 lines (80 loc) · 2.06 KB
/
btree_functions.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
77
78
79
80
81
82
83
84
85
86
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* btree_functions.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: grebett <grebett@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2013/12/14 17:36:04 by grebett #+# #+# */
/* Updated: 2013/12/15 14:41:20 by grebett ### ########.fr */
/* */
/* ************************************************************************** */
#include "hotrace.h"
t_btree *btree_create_node(char *key, char *value)
{
t_btree *node;
node = (t_btree *) malloc(sizeof(t_btree));
if (node != NULL)
{
node->key = ft_strdup(key);
node->value = ft_strdup(value);
node->left = NULL;
node->right = NULL;
}
return (node);
}
void fill_tree(t_btree *node, char *key, char *value)
{
if (ft_strcmp(key, node->key) < 0)
{
if (node->left != NULL)
{
node = node->left;
fill_tree(node, key, value);
}
else
node->left = btree_create_node(key, value);
}
else if (ft_strcmp(key, node->key) > 0)
{
if (node->right != NULL)
{
node = node->right;
fill_tree(node, key, value);
}
else
node->right = btree_create_node(key, value);
}
else
{
free(node->value);
node->value = ft_strdup(value);
}
}
char *search_tree(t_btree *node, char *key)
{
char *str;
if (ft_strcmp(key, node->key) < 0)
{
if (node->left != NULL)
{
node = node->left;
str = search_tree(node, key);
}
else
return (NULL);
}
else if (ft_strcmp(key, node->key) > 0)
{
if (node->right != NULL)
{
node = node->right;
str = search_tree(node, key);
}
else
return (NULL);
}
else
str = node->value;
return (str);
}