COMPLEJIDAD ESTA

                                                                              //O(1)
    private boolean esta(NodoBin<T> r, T x){                                    //T=1+max(1,0)+5+1+max(3,1+max(3,1)) = 1+1+6+4 = 12
        if (r==null)                                                            //1+max
            return (false);                                                     //1
        int compara=((Comparable)r.getInfo()).compareTo(x);                   //5
        if(compara>0)                                                           //1+max
            return(esta(r.getIzq(),x));                                       //3
        else
            if(compara<0)                                                       //1+max
                return(esta(r.getDer(),x));                                   //3
            else                                                                
                return (true);                                                  //1
    }
T=1+max(1,0)+5+1+max(3,1+max(3,1))
T=1+1+6+4 = 12

T=12

O(1)