Yes. This is very similar if you consider the path on the b-tree with the alphabet L, R. It doesn&#x27;t follow traditional lexical sorting though since RRL (5&#x2F;2) comes before RR (3&#x2F;1).<p>This is handy though. Consider having something at index &#x27;a&#x27;. Now find something that comes right before it. You can&#x27;t if you use traditional alphabetical ordering.