On random son-trees

Abstract

Son-trees can be used as node search trees. A new insertion algorithm is given for son-trees used as node search trees. Random son-trees, obtained by random insertions starting with the empty tree, are studied, when the new insertion algorithm is used. The results are compared to known results about another insertion algorithm. The old insertion algorithm will give trees with better storage utilization, but the new insertion algorithm will need less restructurings.

Keywords:

• Data structures
• search trees
• balanced trees
• storage utilization

C.R. Categories:

• 3.73
• 3.74
• 4.34
• 5.25