Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these trees, we offer a universal law of large numbers and a limit law for the depth of the last inserted point, as well as a law of large numbers for the height.
No takes yet. Share an insight, caveat, or question.
Luc Devroye (1998) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: