COMPLEJIDAD BUSCAR

                                                                                //O(1)
    protected NodoBin<T> buscar(NodoBin<T> r, T info){                          //T=1+max(1,0)+2+max(1,1+2+max(1,2)+2) = 1+1+2+5+2 = 11
        if(r==null)                                                             //1+max
            return (null);                                                      //1
        if(r.getInfo().equals(info))                                         //2+max
            return r;                                                           //1
        else
        {
            NodoBin<T> aux = (r.getIzq()==null)?null:buscar(r.getIzq(),info); //1+2+max(1,2)
            if(aux!=null)                                                       //2+max
                return (aux);                                                   //1
            else            
                return (r.getDer()==null)?null:buscar(r.getDer(),info);       //1+2+max(1,2)
        }
    }
T=1+max(1,0)+2+max(1,1+2+max(1,2)+2)
T=1+1+2+5+2 = 11

T=11

O(1)