int main()
{
printf("Test #1 : Insertions \n");
bool tests_reussis = true;
LISTECHAINEE* liste;
liste = (LISTECHAINEE*) malloc( sizeof( listeNode ) );
liste->racine=NULL;
liste->taille=0;
if(liste->taille != 0){
printf(" Erreur #1\n");
tests_reussis = false;
}
for(int i=0;i<5;i++){
BLOC* bloc1;
bloc1 = (BLOC*) malloc(sizeof(bloc));
bloc1->numero_bloc=i;
insert_beginning(liste, bloc1);
if(liste->taille==0){
printf(" Erreur #2\n");
tests_reussis = false;
}
}
if(liste->taille != 5){
printf("Erreur addition\n");
}else{
for(int i=0;i<5;i++){
printf("%d \n", liste->racine->un_bloc->numero_bloc);
BLOC* a =remove_beginning(liste);
printf("%d \n", a->numero_bloc);
printf("taille %d\n", liste->taille);
}
}
if(tests_reussis)
printf("OK\n");
return 0;
}
int main()
{
int choice;//For storing user choice
node *start = NULL; //pointer to the first node, which initially points nowhere
do
{
printf("***************************************************************************\n");
printf("\t\tMENUE\n");
printf("****************************************************************************\n");
printf("\t1.Create List\n");
printf("\t2.Display\n");
printf("\t3.Count\n");
printf("\t4.Add to empty list\n");
printf("\t5.Add at beginning\n");
printf("\t6.Add at end\n");
printf("\t7.Add after node\n");
printf("\t8.Add before node\n");
printf("\t9.Delete\n");
printf("\t10.Quit\n\n");
printf("********************************************************************************\n\n");
printf("Enter your choice : ");
scanf("%d",&choice);
switch(choice)
{
case 1:
create(&start);
break;
case 2:
display(&start);
break;
case 3:
count(&start);
break;
case 4:
insert_empty(&start);
break;
case 5:
insert_beginning(&start);
break;
case 6:
insert_end(&start);
break;
case 7:
insert_after(&start);
break;
case 8:
insert_before(&start);
break;
case 9:
delete_node(&start);
break;
case 10:
break;
default:
printf("Wrong choice\n");
}/*End of switch */
}while(10!=choice); //End of while
free_list(&start);
return 0;
}//end of main
