COMPLEJIDAD AVECTOR

                                                                                //O(n)
    public Object[] aVector(){                                      //T=2+max(1,)+4+3+1+2+E(2+5)+1
        if(this.esVacia())                                                      //2-
                return (null);                                                  //1
        Object vector[]=new Object[this.getTamanio()];                          //4
        Iterator<T> it=this.iterator();                                         //3
        int i=0;                                                                //1
        while(it.hasNext())                                                     //2+E(2)
            vector[i++]=it.next();                                              //5
        return(vector);                                                         //1
    }

T = 2+1+4+3+1+2+2n+5n+1 = 13+7n = n

O(n)