I don’t understand: are Haskell or Scalia trees cache-friendly at all? The reason people don’t use trees is because it’s hard to make them memory-local. Otherw

I don’t understand: are Haskell or Scalia trees cache-friendly at all? The reason people don’t use trees is because it’s hard to make them memory-local. Otherwise it’s obviously easier to conceptually understand.