COMPLEJIDAD ELIMINAR

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

T = max(1+1+11+3+1+1+3+2+3+2,c1+c2+c3)+1

T = 28+1 = 29

O(1)