COMPLEJIDAD INSERTARHIJOIZQ

                                                                                //O(1)
    public boolean insertarHijoIzq(T padre, T hijo){                            //T=2+MAX(3+1,0)+2+1+MAX(2+MAX(3+1,0)+1)+1 = 2+4+2+4+1+1 = 14
        if(this.esVacio()){                                                     //2
            this.setRaiz(new NodoBin<T>(hijo));                               //3
            return (true);                                                      //1
        }   
        NodoBin<T> p = this.buscar(padre);                                 //2
        if(p!=null){                                                            //1+MAX
            if(p.getIzq()==null){                                               //2+MAX
                p.setIzq(new NodoBin<T>(hijo));                              //3
                return (true);                                                  //1
            }                   
            return (false);                                                     //1
        }
        return (false);                                                         //1
    }
T=2+MAX(3+1,0)+2+1+MAX(2+MAX(3+1,0)+1)+1
T=2+4+2+4+1+1 = 14

T=14

O(1)