main.c

#include "arbre.c"
#include <stdio.h>
#include <stdlib.h>


int main()
{

    struct noeud * abr = creer_arbre();
    ajouter(&abr,100);
    ajouter(&abr,170);
    ajouter(&abr,150);
    /**
    ajouter(&abr,20);
    ajouter(&abr,10);
    ajouter(&abr,170);
    ajouter(&abr,120);
    */
    affiche(abr);

    if(predecessor(abr))
        printf("\npredecessor of %d is %d\n",abr->cle,predecessor(abr));
    if(successor(abr))
        printf("\nsuccessor  of %d is %d\n",abr->cle,successor(abr));

/*
  ajouter(&abr,3);
  ajouter(&abr,6);
  ajouter(&abr,4);
  ajouter(&abr,7);
  ajouter(&abr,5);
  ajouter(&abr,1);
  ajouter(&abr,2);
  ajouter(&abr,0);

    */
    /*
  ajouter(&abr,150);
  ajouter(&abr,50);
  ajouter(&abr,20);
  ajouter(&abr,70);
  ajouter(&abr,120);
  ajouter(&abr,170);

*/
/*    
   affiche(abr);
   printf("\nmax= %d\n",recherche_max(abr)->cle);
   printf("\nmin= %d\n",recherche_min(abr)->cle);
 */   
/*   supprimer_element(&abr,5);
   supprimer_element(&abr,4);
   supprimer_element(&abr,3);
   affiche(abr); */
    /* ajouter(&abr,5);
    
    printf("\n%d\n",abr->cle);
    printf("\ngauche %d\n",abr->sag->cle);
    printf("\ndroite %d\n",abr->sad->cle);
    printf("\nEXISTE %d \t : %d\n",abr->sag->cle,recherche(abr,abr->sag->cle));
*/





return 0;}