COMPLEJIDAD PREORDEN(PRIVADO)

   private void  preOrden(NodoEneario<T> r, ListaCD<T> l){
    
        NodoEneario<T> q;//1
        if(r!=null){//2
            l.insertarAlFinal(r.getInfo());//O(1)
            q = r.getHijo();//O(1)+1
            if(q != null){//2
                preOrden(q,l);//t(1)
                q = q.getHermano();//O(1)+1
                while(q != null){//2+e
                    preOrden(q,l);//t(1)
                    q = q.getHermano();//O(1)+1
                }
            }
        }

        
    }

T(n)=17+t(1)+Σ(t(1)+2)
T(n)=17+t(1)+(nt(1))+2n
T(n)=17+t(1)+(nt(1))+2n i=1
T(n)=32+2t(1)+2(nt(1))+4n i=2
T(n)=64+3t(1)+3(nt(1))+8n i=3
T(n)=k+kt(n-k)+(t(k))+kn i=k
T(n)=n+nt(n-n)+n(t(0))+nn i=n
T(n)=nt(0)+nt(0))+3n
T(n)=n+n+3n
O(n)