COMPLEJIDAD GET

                                                                                //O(1)
    public T get(int i)	{                                               //T=1+max(2+2,c1+c2+c3)+1
        NodoD<T> t;                                                             //1
        try {                                                                   //
            t = this.getPos(i);                                                 //2
            return (t.getInfo());                                               //2
        } catch (ExceptionUFPS ex) {                                            //T(EXception)
             System.err.println(ex.getMessage());                               //T(Print)+T(mensaje)
        }   
        return (null);                                                          //1
    }

T = 1+4+1 = 6

O(1)