Ranking and unranking of B-trees

Abstract

Algorithms are presented for the ranking, unranking, and generation of all B-trees of order m with n leaves. The algorithms take time proportional to the sizes of their output. It is shown how a search graph can be constructed to aid in the ranking and unranking of B-trees. © 1983.