Lista BuildList(ALBERO* T,Lista L,METODO *Funzioni_ABR){
    void* p;
    ALBERO *CT = T, *NT=NULL,*LT=NULL;
    Lista CL=L,NL=NULL,LD=NULL,X=NULL,ret=NULL;
    StackV ST=NULL,SL=NULL,SLD=NULL,SX=NULL;

    while (CT || SL){
        if(CT){
            p=cond(CT->Nome);

            ST=PushV(ST,CT);
            SL=PushV(SL,CL);

            NT=CT->Right;
            NL=CL;
            ret=CL;
        }
        /*
        else{
            CT=TopV(ST);
            CL=TopV(SL);
            if(CT->Left && CT->Left != LT){
                LD=ret;
                SLD=PushV(SLD,LD);
                p=cond(CT->Nome);
                p=(int*)p;
                if( ( (int)p %2) == 0 ){
                    X=new_node(CT->Nome);
                    SX=PushV(SX,(void*)X);
                    NT=CT->Left;
                    NL=X;
                    ret=X;
                }
                else{
                    NT=CT->Left;
                    NL=LD;
                    ret=LD;
                }
            }
            else{
                p=cond(CT->Nome);
                p=(int*)p;
                if( ( (int)p %2) == 0 ){
                    CL=ret;

                    LD=TopV(SLD);
                    SLD=PopV(SLD);
                    X=TopV(SX);
                    SX=PopV(SX);

                    X->Next=LD;
                }
                else{
                    CL=ret;
                }
                LT=CT;
                CT=NULL;
                ST=PopV(ST);
                SL=PopV(SL);
            }
        }*/
    CT=NT;
    CL=NL;
    }

}