On the allocation of binary trees to secondary storage

Two paging techniques proposed by Muntz and Uzgalis to store a binary tree in secondary storage are considered. The first method (sequential allocation) is the basic allocation technique and here an exact formula is given, to be considered as a touchstone for every other method. Then a modification to the second method (grouped allocation) is proposed which gains control on storage utilization. This allows the structure to maintain both a high loading factor and a low retrieving time.