COMPLEJIDAD CONTARHOJAS

                                                                               //O(1)
    private int contarHojas(NodoBin<T> r){                                      //T=1+max(1,0)+2+max(1,0)+4+4+2 = 1+1+2+1+10 = 15
        if(r==null)                                                             //1+max
            return (0);                                                         //1
        if(this.esHoja(r))                                                    //2+max
            return (1);                                                         //1
        int chi = contarHojas(r.getIzq());                                    //4
        int chd = contarHojas(r.getDer());                                    //4
        return (chi+chd);                                                       //2
    }
T=1+max(1,0)+2+max(1,0)+4+4+2
T=1+1+2+1+10 = 15

T=15

O(1)