1) Initialisatin

voir init (file *fifo)
{
	fifo > deb = null;
	fifo > fin = null;
	fifo > taille = O;
}


type def struc cell {
	int val;
	struct cell * next;
}cells;

typedef struct file {
	cell * deb;
	cell * fin;
	int taille;
} file



2) Vérification file vide

int isEmpty(fifo *fifo)
{
	if (file != NULL)
		return 0;
	else
		return 1;
}


3) Afficher la pile
void print_fifo (fifo *file)
{
	cell * boite = (cell*)malloc(sizeof(structcell))
	int i
	if (IsEmpty(file)==1) print_f("File vide \n");
	else
	{
		boite = file > deb;
		for (i = 0, i < file -> taille, i++)
		{
			print_f("%d", boite->val)
			boite = boite > next;
		}
	}




4) Dépiler une cellule
pop (fifo + file)
{
	1 : Vérifier si deb = fin
	if (file -> deb == file -> fin) //1 seul élément
	{
		cell * boite = file -> deb
		file -> deb = file->fin = null;
		free(boite);
	}
	else
	{
		cell * boite;
		boite = file -> deb;
		file -> deb = file->deb -> next
		free(boite)//return
	}
}




int push_file(int i, fifo, *file)
{
	cell *nouveau =(cell*)malloc(sizeof(cell*))
	if (file == null)
	{
		return 0;
	}
	nouveau -> vall = i;
	nouveau -> nxt = null;
	if (file -> deb != null)
	{
		file->fin->next=nouveau;
		file->fin = nouveau;
		file->taille++;
		return 1;
	}
	else
	{
		//Création et relier la 1ere boite
		file->deb = nouveau;
		file->fin = nouveau;>
		file-taille++;
		return 1;
	}
	t
}




##############################
Suite du Mardi 7 octobre
##############################


typedef struct lifo {
	int hauteur;
struct cell * sommet;
} lifo;*

int isEmpty-lifo(lifo *p)
{
	if(p->sommet == null) return 1;
	else return 0;
}






######################
ARBRE
######################

typedef struct mode [
	int donnee;
struct node *sag;
struct node *sad;utre new
} node;
typedef node * arbre

int isEmptytree(arbre a)
{
	if (a == null) return 1;
	else return 0;
}






utree new-singleton utree(unsignedcontent)
{

1) Allouer l'espace mémoire

utree noeud = (utree)malloc(sizeof-utree-node));

2) Remplir les infor
noeud -> content = content
noeud -> sof = null;
noeuf -> sod = null;
return noeud;