One method, studied in [FV98,CFV98], to sort real
numbers is to store these numbers in a trie, based on comparing
continuants of the corresponding continued fraction
representations. In [CFV98] asymptotics of expected size and
expected path length of these CF-trees have been derived in
the setting, where the
numbers are random variables independently
drawn from an analytic density on the unit interval. We show that in
that setting size and path length are tightly concentrated around
their expected values, and also address the problem of finding
limiting distributions.