After all, it's not immediately ob -
vious why you'd compare a different coordinate at each level of the tree. It turns out that there is a
beautiful geometric meaning behind this setup, and by exploiting this structure it's possible to perform
nearest-neighbor lookups extremely efficiently (in time better than O(n)) using a kd-tree