Degree profile of $m$-ary search trees: A vehicle for data structure compression

Ravi Kalpathy, Hosam Mahmoud

We revisit the random $m$-ary search tree and study a finer profile of its node outdegrees with the purpose of exploring possibilities of data structure compression. The analysis i…