COMPLEJIDAD INSERTAR AL FINAL

                                                                                //O(1)
    public void insertarAlFinal(T x){                                           //T=2+max(1,1+max(4+1+1+2+3,c1+c2+c3))
        if(this.cabeza==null)                                                   //2-
            this.insertarAlInicio(x);                                           //1
        else{                                   
            NodoD<T> ult;                                                       //1
            try {                                                                   
                ult = this.getPos(this.tamanio - 1);                            //4
                if(ult==null)                                                   //1
                    return;                                                     //1
                ult.setSig(new NodoD<T>(x, null, ult));                         //2
                this.tamanio++;                                                 //3
            } catch (ExceptionUFPS ex) {                                        //T(exception)
               System.err.println(ex.getMessage());                             //T(print)+T(mensaje)
            }
        }
    }

T = 2+12 = 14

O(1)