COMPLEJIDAD GETPESO

                                                                                //O(1)
    private int getPeso(NodoBin<T> r){                                          //T=1+MAX(1,0)+6 = 1+1+6 = 8
        if(r==null)                                                             //1
            return 0;                                                           //1
        return (getPeso(r.getIzq())+1+getPeso(r.getDer()));                 //6
    }
T=1+MAX(1,0)+6
T=1+1+6 = 8

T=8

O(1)