diff --git a/dico.c b/dico.c
new file mode 100644
index 0000000..2289146
--- /dev/null
+++ b/dico.c
@@ -0,0 +1,19 @@
+#include "dico.h"
+
+void make_empty_dico(dico d){
+  for(int i=0;i<NB1CHAR;i++)
+    d[i]=NULL;
+}
+void delete_dico(dico_d){
+  for(int i=0;i<NB1CHAR;i++)
+    delete_tree(d[i]);
+}
+
+
+int hash2(char c){
+  //needs to check isalpha==true
+  if(c<='Z')
+    return c-'A';
+  return c-'a'+26;
+}
+bool addto_dico(dico,string){}
diff --git a/dico.h b/dico.h
new file mode 100644
index 0000000..732320d
--- /dev/null
+++ b/dico.h
@@ -0,0 +1,22 @@
+#ifndef DICO_H
+#define DICO_H
+
+#include "treeh.h"
+
+#define NB1CHAR 52 // A-Z + a-z
+
+typedef tree dico[NB1CHAR];
+
+void make_empty_dico(dico);
+void delete_dico(dico);
+int hash2(char);//needs to check isalpha==true
+bool addto_dico(dico,string);
+
+void loadfrom_file(dico,FILE*);
+void loadfrom_keyboard(dico);
+
+void printto_file(dico,FILE*);
+void printto_terminal(dico);
+
+
+#endif
diff --git a/treeh.h b/treeh.h
index 804b1b4..f82714a 100644
--- a/treeh.h
+++ b/treeh.h
@@ -10,7 +10,7 @@
 
 
 typedef struct _node node, *tree;
-struct node{
+struct _node{
   char letter;
   bool isEnd;
   node* next[NBCHAR];
@@ -24,12 +24,10 @@ void delete_tree(tree);
 bool is_empty(tree);
 bool is_end(tree);
 bool is_followed(tree);//tells if tree has following letters
-int hash(char);
+int hash(char);//need to check if isalpha
 
 void addto_tree(tree,string,int);
 void addto_tree2(tree,string);
-void loadfrom_file(tree,FILE*);
-void loadfrom_keyboard(tree);
 
 
 #endif //TREEH_H
--
libgit2 0.21.2