every fraction exactly once · mediant construction · path = continued fraction · binary search for rationals · runs locally
mediant(a/b, c/d) = (a+c)/(b+d) · every positive rational appears exactly once · path to fraction encodes continued fraction as L/R turns · navigating the tree = Euclidean algorithm