COMPLEJIDAD GORDURA

public int gordura(){
       if(this.esVacio())//O(1)+1
            return (0);//2
       int masGordo = -1;//2
       Cola<NodoEneario<T>> cola = new Cola<NodoEneario<T>>();//O(1)+O(1)+1
       Cola<Integer> c = new Cola<Integer>();//O(1)+1
       NodoEneario<T> s, q;//2
       int i=0;//1
       int cont=1,ant=-1; //4
       cola.enColar(this.getRaiz());//O(1)+O(1)+1
       c.enColar(i);//O(1)+1
       while(!cola.esVacia()){//2+e
           q = cola.deColar();//O(1)+2
           i = c.deColar();//O(1)+2
           if(i!=ant){//2
               if(masGordo < cont){//1
                   masGordo = cont;//2
               }
               cont=0;//2
               ant=i;//2
           }
           cont++;//3
           s = q.getHijo();//O(1)+1
           while(s != null){//2+e
               cola.enColar(s);//O(1)+1
               c.enColar(i+1);//O(1)+2
               s = s.getHermano();//O(1)+1
           }
       }
       return ((masGordo<cont)?cont:masGordo);//4
      
 
   }

T(n)=2+2+2+3+2+2+1+4+3+2+2+Σ(3+3+2+1+2+2+2+3+2+2+Σ(3+3+2))+4
T(n)=29+Σ(23+Σ(8))
T(n)=29+23n+8n²
O(n²)