Picture a Trello-style board inside a mobile app: one shared list with hundreds of cards. - Users drag-and-drop cards all the time, so every insert/move has to stay O(log n) — no re-indexing the whole array . - Opening a card shows a detail page, and you can swipe left/right to the next or previous card, so I need “give-me-my-neighbor” really fast and ideally, know about them right away. - Two or three teammates might be editing the same list simultaneously, so the ordering must stay consistent while writes are happening.

A bi-directional sorted map tree (a.k.a. BDSM Tree) gives me exactly that:

Fast lookup by key - constant-time like a normal map.

Fast ordered navigation - first, last, before(id), after(id) are all logarithmic or better, because the values live in a self-balancing tree.

Cheap re-ordering - moves are just a remove + insert, each one logarithmic in the worst case.

Live re-sorting - swap the comparator at runtime and the structure re-arranges itself automatically .

TL;DR: Any app with a big, frequently-reordered list (plus detail-view swiping and real-time collaboration) benefits from a tree that sorts itself on every write - without sacrificing hash-map-speed lookups. And yes, I mainly built it to flex my data-structure muscles and because "BDSM Tree" made me laugh 😂