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 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205
|
#include<stdio.h>
#include <malloc.h>
#include <windows.h>
#include <iostream>
using namespace std;
#define M 5
enum etat {Doublon,EchecRecherche,Succes,InsererCle}; // declaration de type enum pour les etats de cles (insertions)
struct noeud // declaration structure noeud
{
int n;
char *cle[M-1];
struct noeud *p[M];
}*racine=NULL;
int recherchePos(char cle[30], char *champs[M-1], int n)
{
int pos=0;
while (pos < n && (strcmp(cle, champs[pos])>0))
pos++;
return pos;
}
void recherche(char cle[30])
{
int pos, i, n;
struct noeud *ptr = racine;
while (ptr)
{
n = ptr->n;
pos = recherchePos(cle, ptr->cle, n);
if (pos < n && (strcmp(cle, ptr->cle[pos])==0))
{
printf("la position est %d\n",pos+1);
return;
}
ptr = ptr->p[pos];
}
printf(" %s n'existe pas .\n",cle);
}
enum etat ins(struct noeud *ptr, char cle[30], char cletmp[30],struct noeud **nouveau_noeud)
{
struct noeud *newPtr, *lastPtr;
int pos, i, n, MPos;
char nlle_cle[30], dern_cle[30];
enum etat valeur;
if (ptr == NULL)
{
*nouveau_noeud = NULL;
strcpy(cletmp, cle);
return InsererCle;
}
n = ptr->n;
pos = recherchePos(cle, ptr->cle, n);
if (pos < n && (strcmp(cle, ptr->cle[pos]) ==0))
return Doublon;
valeur = ins(ptr->p[pos], cle, nlle_cle, &newPtr);
if (valeur != InsererCle)
return valeur;
if (n < M - 1)
{
pos = recherchePos(nlle_cle, ptr->cle, n);
for (i=n; i>pos; i--)
{
strcpy(ptr->cle[i],ptr->cle[i-1]);
ptr->p[i+1] = ptr->p[i];
}
strcpy(ptr->cle[pos], nlle_cle);
ptr->p[pos+1] = newPtr;
++ptr->n;
return Succes;
}
if (pos == M - 1)
{
strcpy(dern_cle, nlle_cle);
lastPtr = newPtr;
}
else
{
strcpy(dern_cle, ptr->cle[M-2]);
lastPtr = ptr->p[M-1];
for (i=M-2; i>pos; i--)
{
strcpy(ptr->cle[i], ptr->cle[i-1]);
ptr->p[i+1] = ptr->p[i];
}
strcpy(ptr->cle[pos], nlle_cle);
ptr->p[pos+1] = newPtr;
}
MPos = (M - 1)/2;
strcpy(cletmp, ptr->cle[MPos]);
(*nouveau_noeud)= new noeud;//(noeud*)malloc(sizeof(struct noeud));
ptr->n = MPos;
(*nouveau_noeud)->n = M-1-MPos;
for (i=0; i < (*nouveau_noeud)->n; i++)
{
(*nouveau_noeud)->p[i] = ptr->p[i + MPos + 1];
if(i < (*nouveau_noeud)->n - 1)
strcpy((*nouveau_noeud)->cle[i], ptr->cle[i + MPos + 1]);
else
strcpy((*nouveau_noeud)->cle[i], dern_cle);
}
(*nouveau_noeud)->p[(*nouveau_noeud)->n] = lastPtr;
return InsererCle;
}
void insertion(char cle[30])
{
struct noeud *nouveau_noeud;
char cletmp[30];
enum etat valeur;
valeur = ins(racine, cle, cletmp, &nouveau_noeud);
if (valeur == Doublon)
cout<<"doublon !"<<endl;
if (valeur == InsererCle)
{
struct noeud *nouvelle_racine = racine;
racine=(noeud*) malloc(sizeof(struct noeud));
racine->n = 1;
strcpy(racine->cle[0], cletmp);
racine->p[0] = nouvelle_racine;
racine->p[1] = nouveau_noeud;
}
}
void affichage(struct noeud *ptr)
{
if (ptr)
{
int i;
for (i=0; i <= ptr->n; i++)
affichage(ptr->p[i]);
for (i=0; i < ptr->n; i++)
cout<<ptr->cle[i]<<" ";
cout<<endl;
}
}
int main()
{
char c;
char cle[30];
int choix;
while ( 1 )
{
cout<<"*******menu*****"<<endl;
cout<<"1 = ajout"<<endl;
cout<<"2 = Rechercher"<<endl;
cout<<"3 = Affichage"<<endl;
cout<<"4=Quitter\n\n"<<endl;
cout<<"votre choix : ";
cin>>choix;
switch ( choix )
{
case 1:
do
{
cout<<"donnez la cle : ";
cin>>cle;
insertion(cle);
cout<<"voulez vous continuer (O/N): ";
cin>>c;
}while((c == 'O')||(c == 'o'));
break;
case 2:
cout<<"Entrer la cle : ";
cin>>cle;
recherche(cle);
break;
case 3:
cout<<"L'arbre est:\n\n\n";
affichage(racine);
break;
case 4:
return 0;
default:
cout<<" Erreur !\n\n";
break;
}
}
return 0;
} |
Partager