BiFrunze1

#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("bifrunze1.in");
ofstream fout("bifrunze1.out");
int nt[5001],n=-1;
struct nod
{
    int info;
    nod * st, *dr;
};

void citire(nod * & p)
{
    int x;
    fin>>x;
    if(x==0)
        p=NULL;
    else
    {
        p=new nod;
        p->info=x;
        citire(p->st);
        citire(p->dr);
    }
}

void preordine(nod * p)
{
	if(p!=NULL)
	{
		if(p->st==NULL&&p->dr==NULL)
            n++,nt[n]=p->info;
		preordine(p->st);
		preordine(p->dr);
	}
}

void stergeTot(nod * & p)
{
	if(p!=NULL)
	{
		stergeTot(p->st);
		stergeTot(p->dr);
		delete p;
		p=NULL;
	}
}

int main()
{
    nod * p = NULL;
    citire(p);
    preordine(p);
    n++;
    sort(nt,nt+n);
    for(int i=0;i<n;i++)
        fout<<nt[i]<<' ';
    fout<<endl;
    stergeTot(p);
    return 0;
}