For an n-ary tree like a B-tree I think you have to take at least log2(n) monoid op evals per monoid update? So I can see why it would take away efficiency.