When ag85aor1 ordering firstly values are put into step-by-step-collecting-prefixes tree and secondly values are read in depth-first-traversal order (the read set is ordered in the order of depth-first traversal).
There is code which demonstrates idea of this ordering with binary step-by-step-collecting-prefixes tree for fixed-size unsigned integer in public repository services github.com (https://github.com/ArthurGolubev1985/AG85AOR1AlgorithmOfOrderingIdeaDemo.git), codeberg.org (https://codeberg.org/ArthurGolubev1985/AG85AOR1AlgorithmOfOrderingIdeaDemo.git) and gitflic.ru (https://gitflic.ru/project/arturische/ag85aor1algorithmoforderingideademo).