suppression

tvieuble
1 parent f00fa1d1
Showing 1 changed file with 0 additions and 60 deletions Show diff stats
projet0.c~
@@ -1,60 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-
-#define A 26
-
-struct node {
-  char lettre;
-  struct cell* listeLettre;
-};
-
-struct cell {
-  struct node* arbre;
-  struct cell* suivant;
-};
-
-void initialisation_tab_arbre(struct node tab[]) {
-  for(int i = 0; i < A; i++) {
-    tab[i].lettre = 97+i;   //ajout lettres minuscules
-  }
-  /*for(int i = 0; i < 8; i++) {
-    tab[i+26].lettre = 130+i;  //ajout caractères spéciaux
-    }*/
-}
-
-void ajout_tete(char elem, struct cell** pL) {
-  struct cell* p;
-  p = malloc(sizeof(struct cell));
-  p->arbre = malloc(sizeof(struct node));
-  p->arbre->lettre = elem;
-  p->suivant = *pL;
-  *pL = p;
-}
-
-void insertion(char elem, struct cell** pL) {
-  if((*pL == NULL)||((*pL)->arbre->lettre > elem)) ajout_tete(elem, pL);
-  else if((*pL)->arbre->lettre == elem) return;
-  else insertion(elem, &(*pL)->suivant);
-}
-
-/*void affiche_tab(struct node tab[]) {
-  for(int i = 0; i < 32; i++) {
-    printf("%c\n", tab[i].lettre);
-  }
-  }*/
-
-void lire_fichier() {
-  
-}
-
-int main() {
-  struct node tab_arbre[A];
-  struct node Arbre;
-  char lettre;
-  Arbre.listeLettre = NULL;
-  initialisation_tab_arbre(tab_arbre);
-  scanf("%c", &lettre);
-  insertion(lettre, &(Arbre.listeLettre));
-  //printf("lettre : %c\n", Arbre.listeLettre->arbre->lettre);
-  return 0;
-}