This article doesn't make a lot of sense to me. It avoids using computer science terminology (like "tree traversal") that would clarify the author's intent here

This article doesn't make a lot of sense to me. It avoids using computer science terminology (like "tree traversal") that would clarify the author's intent here. I don't follow at all the example of searching for the number 62, deciding that the triplet 41-23-61 contains all numbers greater than 62, and then deciding to "access the 4th child" 73-67-79 — what is the 4th child in a binary tree? How do we determine the index to move to in our flattened array? It would probably be better to read the original paper "FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs" (https://doi.org/10.1145/1807167.1807206 https://doi.org/10.1145/1807167.1807206) if this is of interest.