I've never heard of the eytzinger layout but it seems like it's just a static binary tree on a array (children are at 2i and 2i+1), commonly used for heaps and

I've never heard of the eytzinger layout but it seems like it's just a static binary tree on a array (children are at 2i and 2i+1), commonly used for heaps and segment trees. Very readable blog post on how it helps with binary search: https://algorithmica.org/en/eytzinger https://algorithmica.org/en/eytzinger With follow up post on N-ary approaches: https://algorithmica.org/en/b-tree https://algorithmica.org/en/b-tree