COMPLEJIDAD ELIMINAR

                                                                             //O(1)
    public T eliminar(int i){ //T=max(1+1+max(3+3+4+1+1+3+2,)+3+2+2+2+1+1+3+2,c1+c2+c3)+1
        try{    
            NodoD<T> x;                                                         //1
            if(i==0){                                                           //1-
                x = this.cabeza.getSig();                                       //3
                this.cabeza.setSig(x.getSig());                                 //3
                this.cabeza.getSig().setAnt(this.cabeza);                       //4
                x.setSig(null);                                                 //1
                x.setAnt(null);                                                 //1
                this.tamanio--;                                                 //3
                return (x.getInfo());                                           //2
            }
            x=this.getPos(i-1);                                                 //3
            NodoD<T> y = x.getSig();                                            //2
            x.setSig(y.getSig());                                               //2
            y.getSig().setAnt(x);                                               //2
            y.setSig(null);                                                     //1
            y.setAnt(null);                                                     //1
            this.tamanio--;                                                     //3
            return(y.getInfo());                                                //2
        }catch(ExceptionUFPS ex) {                                              //T(Exception)
            System.err.println(ex.getMessage());                                //T(mensaje)+T(print)
        }                                                           
    return(null);                                                               //1
    }

T = 34

O(1)