6aacc52e
 grouille
Correction légère
|
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
|
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
typedef struct node* Node;
typedef struct node {
char letter;
Node next[26];
bool endWord;
}node;
void mk_empty_tree(Node* Tree)
{
*Tree = NULL;
}
bool is_empty_tree(Node* Tree)
{
return(*Tree==NULL);
}
void init_tree(Node* Tree)
{
if(is_empty_tree(Tree))
{
*Tree = malloc(sizeof(Node));
Tree->letter = '?';
Tree->endWord = false;
for(int i=0; i<26; i++)
Tree->next[i] = NULL;
}
}
void add_in_tree(Node Tree, char word[])
{
char letter = word[0];
while(letter != '/0')
{
if(Tree->next[letter-'a']!=NULL)
Tree = Tree->next[letter-'a'];
else
{
Node new = NULL;
new = malloc(sizeof(Node));
new->letter = letter;
for(int i=0; i<26; i++)
{
new->next[i]=NULL;
}
Tree->next[letter-'a'] = new;
}
}
}
int main(int argc, char argv[])
{
return 0;
}
|