COMPLEJIDAD IMPNIVELES

                                                                                //O(n)
    public Iterator<T> impNiveles(){                                            //T=2+2+max(3+2+1+2+E(2+2+2+2+max(2,0)+2+max(2,0)),0)+1 = 4+8+1+8n+2n+4n = 13+14n = n
        ListaCD<T> l=new ListaCD<T>();                                          //2
        if(!this.esVacio()){                                                    //2+max
            Cola<NodoBin<T>> c=new Cola<NodoBin<T>>();                          //3
            c.enColar(this.getRaiz());                                      //2
            NodoBin<T> x;                                                       //1
                while(!c.esVacia()){                                            //2+E(2)
                    x=c.deColar();                                              //2
                    l.insertarAlFinal(x.getInfo());                         //2
                    if(x.getIzq()!=null)                                        //2+max
                    c.enColar(x.getIzq());                                  //2
                    if(x.getDer()!=null)                                        //2+max
                    c.enColar(x.getDer());                                 //2
                }
        }
        return (l.iterator());                                                  //2
    }
T=2+2+max(3+2+1+2+\sum_{1=0}^{n}(2+2+2+2+max(2,0)+2+max(2,0)),0)+1
T= 4+8+1+8n+2n+4n = 13+14n = n

T=13+14n

O(n)