COMPLEJIDAD GETPOS

                                                                   //O(n)
    private Nodo<T> getPos(int i)throws ExceptionUFPS{ //T=4+max(c1+1,)+3+1+E(2+1)
        if(i<0||i>=this.tamanio){                                               //4
            System.err.println("Error indice no valido en una Lista Circular!");//T(Print)
            return (null);                                                      //1
        }   
        Nodo<T> x=cabeza.getSig();                                              //3
        for( ; i-->0; x=x.getSig());                                            //1+E(2)
            return x;                                                           //1
    }

T = 4+c1+1+3+1+2n+1n = 9+3n+c1 = n

O(n)