COMPLEJIDAD ESTA(PRIVADO)

private boolean esta(NodoEneario<T> r, T dato){  
       NodoEneario<T> q;//2
       boolean s;//1
       if(r==null)//2
           return (false);//c1
       if(r.getInfo().equals(dato))//3
           return (true);//c2
       q = r.getHijo();//2
       while(q != null){//2+e
           s = esta(q, dato);//t(1)
           if(s)//1
               return (true);//c3
           q = q.getHermano();//2
       }//
       return (false);//c4

       
    }

T(n)=2+1+2+c1+3+c2+2+2+Σ(T(1)+1+c3+2)+c4
T(n)=12+c1+c2+Σ(T(1)+1+c3+2)+c4
T(n)=12+c1+c2+n(T(1))+3n+nc3+c4
T(n)=12+C1+C2+(n*T(1))+3n+nc3+C4 i=0
T(n)=12+C1+C2+(n*T(1))+3n+nc3+C4 i=1
T(n)=24+2C1+2C2+2(n*T(1))+6n+2nc3+2C4 i=2
T(n)=k+kC1+kC2+k(n*T(1))+kn+knc3+kC4 i=k
T(n)=n+nC1+nC2+n(n*T(1))+n+n+nnc3+nC4 i=n
T(n)=nC1+nC2+nT(0)+3n+2nc3+nC4 i=n
O(n)