BiArbore

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

ifstream fin("biarbore.in");
ofstream fout("biarbore.out");
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 stergeTot(nod * & p)
{
	if(p!=NULL)
	{
		stergeTot(p->st);
		stergeTot(p->dr);
		delete p;
		p=NULL;
	}
}

int main()
{
    nod * p=NULL;
    citire(p);
    int info_st,info_dr;
    if(!p->st)
        info_st=0;
    else
        info_st=p->st->info;
    if(!p->dr)
        info_dr=0;
    else
        info_dr=p->dr->info;
    if(p->st||p->dr)
        fout<<info_st<<' '<<info_dr;
    else
        fout<<0;
    stergeTot(p);
    return 0;
}