COMPLEJIDAD GETHIJOS

public Iterator<T> getHijos(T padre){
       ListaCD<T> l=new ListaCD<T>();//2
       NodoEneario p = this.buscar(this.raiz, padre);//2+O(n)
       if(p==null)//2
           return (l.iterator()); //Este Nodo no existe//O(1)
       NodoEneario q = p.getHijo();//O(1)+1
       while(q!=null){//2+E()
           l.insertarAlFinal((T)q.getInfo());//O(1)+O(1)+1
           q = q.getHermano();//O(1)+1
       }
       return(l.iterator());//O(1)+1
       
   }

T(n)=2+2+n+2+2+2+Σ(3+2)+2
T(n)=4+n+4+Σ(3+2)+2
T(n)=10+n+3n+2n
T(n)=10+n+5n
O(n)