Binary_Tree_Algorithm_Project/dico.h at main · OnsAffes/Binary_Tree_Algorithm_Project · 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
#ifndef DICO_H_INCLUDED
#define DICO_H_INCLUDED

/* -------------------------------------------------------*/
/* Primitives de gestion d’un dictionnaire */
 /* -------------------------------------------------------*/
// declaration
struct Noeud {
  char lettre;
  int  nboccurrence;
  struct Noeud* fgauche;
  struct Noeud* fdroite;
};

typedef struct Noeud* TArbre;


void dicoAfficher(TArbre a);
void dicoInsererMot(char mot[], TArbre *pa);
int dicoNbOcc(char mot[], TArbre a);
int dicoNbMotsDifferents(TArbre a);
int dicoNbMotsTotal(TArbre a);
void afficherMots(char *mot, TArbre a);
int piocherMot(char *motPioche);
int nombreAleatoire(int nombreMax);
 /* -------------------------------------------------------*/


#endif