In the original “Balanced Search Trees Made Simple” paper by Arne Andersson, the first paragraph of the second chapter mentions that a single bit could be the flag before introducing the traditional integer level tracking. Does anyone know what the single-bit version would look like? How would insertion, deletion, skewing, and splitting work?