COMPLEJIDAD BUSCAR

private NodoEneario<T> buscar(T dato){
        if(this.esVacio())//O(1)+1
            return (null);//C
        return (this.buscar(this.raiz,dato));//2+O(n)

    }

T(n)=2+c+2+n
T(n)=4+c+n
O(n)