COMPLEJIDAD GETINDICE

                                                                              //O(n)
    public int getIndice(T info){                                //T=1+6+E(3+3+max(1,)+2)+1
        int i=0;                                                                //1
        for(NodoD<T> x=this.cabeza;x!=null;x=x.getSig()){                       //6+E(3)
            if(x.getInfo().equals(info))                                        //3
                return (i);                                                     //1
            i++;                                                                //2
        }                                           
        return (-1);                                                            //1
    }

T = 1+6+3n+3n+1n+2n+1 = 8+9n = n

O(n)