COMPLEJIDAD ELIMINAR

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

T = 2+1+3+1+8+1+3+2 = 21

O(1)