COMPLEJIDAD GETINDICE

                                                                              //O(n)
    public int getIndice(T dato){                                               //T=1+8+E(4+3+max(1+2))+1
        int i=0;                                                                //1
        for(Nodo<T> x=this.cabeza.getSig();x!=this.cabeza;x=x.getSig()){        //8+E(4)
            if(x.getInfo().equals(dato))                                        //3
            return(i);                                                          //1
            i++;                                                                //2
        }    	
        return (-1);                                                            //1
    }    

T = 1+8+4n+3n+3n+1 = 10+10n = n

O(n)