COMPLEJIDAD ELIMINARC2

                                                                                //O(1)
    private boolean eliminarC2(NodoBin<T> r){                                   //T=3+3+2+1+max(1+1,0)+3+3+1+max(2+1+1+1,0)+1+max(2+1+1+1,0)+1 = 9+2+7+5+1+5+1 = 30
        NodoBin<T> p = this.getPadre(r);                                        //3
        NodoBin<T> ha = r.getIzq()!=null?r.getIzq():r.getDer();                 //3+2
        if(p==null){                                                            //1+max
            this.setRaiz(ha);                                               //1
            return (true);                                                      //1
        }                                               
        NodoBin<T> hi = p.getIzq();                                             //3
        NodoBin<T> hd = p.getDer();                                             //3
        if (hi==r){                                                             //1+max
            this.getPadre(r).setIzq(ha);                                      //2
            r.setDer(null);                                                   //1
            r.setIzq(null);                                                   //1
            return true;                                                        //1
        } 
        if (hd==r) {                                                            //1+max
            this.getPadre(r).setDer(ha);                                      //2
            r.setDer(null);                                                   //1
            r.setIzq(null);                                                   //1
            return true;                                                        //1
        } 
        return false;                                                           //1
    }
T=3+3+2+1+max(1+1,0)+3+3+1+max(2+1+1+1,0)+1+max(2+1+1+1,0)+1
T=9+2+7+5+1+5+1 = 30

T=30

O(1)