BINARNO STABLO

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct CVOR
{
int key;
struct CVOR *cvor_levo;
struct CVOR *cvor_desno;
};
void dodaj(struct CVOR *i,int h)
{
i->key=h;
};
struct CVOR *create ()
{
CVOR i=(CVOR) malloc (sizeof(struct CVOR));
i->cvor_levo=0;
i->cvor_desno=0;
return i;
}
void PREORDER(struct CVOR *i)
{
printf("%d ",i->key);
if (i->cvor_levo != 0)
PREORDER(i->cvor_levo);
if (i->cvor_desno !=0)
PREORDER(i->cvor_desno);
};
void INORDER(struct CVOR *i)
{
if (i->cvor_levo != 0)
INORDER(i->cvor_levo);
printf("%d ",i->key);
if (i->cvor_desno !=0)
INORDER(i->cvor_desno);
};
void POSTORDER(struct CVOR *i)
{
if (i->cvor_levo != 0)
POSTORDER(i->cvor_levo);
if (i->cvor_desno !=0)
POSTORDER(i->cvor_desno);
printf("%d ",i->key);
};
void main(void)
{
struct CVOR *koren;
koren=create ();
dodaj (koren,10);
koren->cvor_levo=create ();
dodaj (koren->cvor_levo,6);
koren->cvor_levo->cvor_levo=create ();
dodaj (koren->cvor_levo->cvor_levo,3);
koren->cvor_desno=create ();
dodaj (koren->cvor_desno,16);
koren->cvor_desno->cvor_levo=create ();
dodaj (koren->cvor_desno->cvor_levo,12);
koren->cvor_desno->cvor_desno=create();
dodaj (koren->cvor_desno->cvor_desno,18);
koren->cvor_desno->cvor_desno->cvor_levo=create();
dodaj (koren->cvor_desno->cvor_desno->cvor_levo,17);
koren->cvor_desno->cvor_desno->cvor_desno=create();
dodaj (koren->cvor_desno->cvor_desno->cvor_desno,22);
koren->cvor_desno->cvor_levo->cvor_desno=create();
dodaj (koren->cvor_desno->cvor_levo->cvor_desno,13);
printf("%s\n","Preorder: ");
PREORDER(koren);
printf("\n\n");
printf("%s\n","Inorder: ");
INORDER(koren);
printf("\n\n");
printf("%s\n","Postorder: ");
POSTORDER(koren);
printf("\n\n");