Algoritmide ja andmestruktuuride praktikum
printf("%c ",pu->label);
if(pu->v!=NULL){
pre(pu->v);
}
if(pu->p!=NULL){
pre(pu->p);
}
}
void in(struct t *pu){
if(pu->v!=NULL){
in(pu->v);
}
printf("%c ",pu->label);
if(pu->p!=NULL){
in(pu->p);
}
}
void pos(struct t *pu){
if(pu->v!=NULL){
pos(pu->v);
}
if(pu->p!=NULL){
pos(pu->p);
}
printf("%c ",pu->label);
}
int main(){
struct t *puu;
printf("Sisseprogrameeritud puu on n");
tr(&a);
printf("n");
getchar();
ttr(&a);
printf("n");
getchar();
mf=fopen("puud","w");
wp(&a);
fflush(mf);
fclose(mf);
mf=fopen("puud","r");
puu=rp();
printf("nPuu kettalt : n");
tr(puu);
printf("nn");
ttr(puu);
printf("n");
printf("nPreorder on: ");
pre(puu);
printf("nInorder on: ");
in(puu);
printf("npostorder on: ");
pos(puu);
printf("n");
fclose(mf);
annaabi.ee 
