COMPLEJIDAD INSERTARHIJODER

                                                                                //O(1)
    public boolean insertarHijoDer(T padre, T hijo){                            //T = 2+max(2+1,0)+3+2+max(2+max(2+1,0)+1,0)+1 = 2+2+1+3+2+2+2+1+1+1 = 17
        if(this.esVacio()){                                                     //2+max
            this.setRaiz(new NodoBin<T>(hijo));                               //2
            return (true);                                                      //1
        }                       
        NodoBin<T> p = this.buscar(padre);                                  //3
        if(p!=null){                                                            //2+max
            if(p.getDer()==null){                                               //2+max
                p.setDer(new NodoBin<T>(hijo));                               //2
                return (true);                                                  //1
            }   
            return (false);                                                     //1
        }
        return (false);                                                         //1
    }
T = 2+max(2+1,0)+3+2+max(2+max(2+1,0)+1,0)+1
T =2+2+1+3+2+2+2+1+1+1 = 17

T=17

O(1)