This page is part of the web mail archives of SRFI 121 from before July 7th, 2015. The new archives for SRFI 121 contain all messages, not just those from before July 7th, 2015.
Yes, that's the Stern-Brocot tree discussed in the same paper. The trouble
is that you need to keep around more (indeed, increasingly more) state.
Here's the Haskell version from the paper:
rats :: [Rational]
rats = concat (unfolds infill [(0,1),(1,0)])
unfolds f a = let (b,a') = f a in b : unfolds f a0
infill xs = (map mkRat ys,interleave xs ys)
where ys = zipWith adj xs (tail xs)
interleave (x : xs) ys = x : interleave ys xs
interleave   =