COMPLEJIDAD GET

                                                                              //O(1)
    public T get(int i){                                                        //T=max(3+1+max(1,)+2,C1+C2+C3)+1
        try {                                                      
                Nodo<T> x=this.getPos(i);                                       //3
                if(x==null)                                                     //1
                    return (null);                                              //1
                return(x.getInfo());                                            //2
            }catch (ExceptionUFPS ex) {                                         //T(Exception)
                System.err.println(ex.getMensaje());                            //T(Mensaje)+T(print)
            }
            return (null);                                                      //1
    }

T = 5+1 = 6

O(1)