@vzn m.youtube.com/watch?v=6BBx8BwLhqg imagine somebody plays huge neocubes near by, and magnet is bigger. I calculated this once during classes, walls are never thick enough ;)

Succint data structures are cool, but if somebody does not know yet how BST is stored in array or with structures I think there is a gap between undestanding basics and using space efficient structures. Also many of askers would have to learn about bit operations and switch to lower level language than they are using (if already are). The most of the time when no additional info is provided

probable case is to start using them, or optimise time. Optimising space is rather on embedded systems or special occassions. And whenever there is answer about succint data structure nobody is eager to tell that they are less efficient (I know, this is not big overhead, but not always neglible)

In my not humble opinion this is overkill

I am not telling that it is wrong or something, just got feeling that if somebody writes O(logn) on BST is probably not there yet. Oh, and I triple checked, I do understand notation, confused symbols, but knew what is going on

During classes I was supposed to use sandwitch theorem instead of cute Landau notation, so there was mismatch in that.

I checked - hope that is the name, because I knew it under "theorem about three convergent series" literally