Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- typedef struct CELLULE cellule;
- struct CELLULE
- {
- int val;
- struct CELLULE *next;
- };
- typedef struct CELLULE* liste;
- liste remplirEnTete(int i, liste tete)
- {
- liste nouvCellule = malloc(sizeof(cellule));
- nouvCellule->val = i;
- nouvCellule->next = tete;
- return nouvCellule;
- }
- liste remplirEnFin(int i, liste tete)
- {
- liste nouvCellule = malloc(sizeof(cellule));
- nouvCellule->val = i;
- nouvCellule->next = NULL;
- if(tete == NULL)
- {
- return nouvCellule;
- }
- else
- {
- liste temp = tete;
- while(temp->next != NULL)
- {
- temp = temp->next;
- }
- temp->next = nouvCellule;
- return tete;
- }
- }
- void afficherListe(tete)
- {
- liste temp = tete;
- printf("\n");
- while(temp != NULL)
- {
- printf("%d",temp->val);
- temp = temp->next;
- }
- }
- liste suppressionEnTete(liste tete)
- {
- liste temp = tete->next;
- free(tete);
- return temp;
- }
- liste suppresionEnFin(liste tete)
- {
- liste temp = tete;
- liste temp2;
- while(temp->next != NULL)
- {
- temp2 = temp;
- temp = temp->next;
- }
- temp2->next = NULL;
- free(temp);
- return tete;
- }
- void main()
- {
- liste tete = NULL;
- int i;
- for(i=1;i<=9;i++)
- {
- tete = remplirEnTete(i,tete);
- tete = remplirEnFin(i, tete);
- }
- afficherListe(tete);
- tete = suppressionEnTete(tete);
- afficherListe(tete);
- tete = suppresionEnFin(tete);
- afficherListe(tete);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement