On weighted depths in random binary search trees
Abstract
Following the model introduced by Aguech, Lasmar and Mahmoud [Probab. Engrg. Inform. Sci. 21 (2007) 133-141], the weighted depth of a node in a labelled rooted tree is the sum of all labels on the path connecting the node to the root. We analyze weighted depths of nodes with given labels, the last inserted node, nodes ordered as visited by the depth first search process, the weighted path length and the weighted Wiener index in a random binary search tree. We establish three regimes of nodes depending on whether the second order behaviour of their weighted depths follows from fluctuations of the keys on the path, the depth of the nodes, or both. Finally, we investigate a random distribution function on the unit interval arising as scaling limit for weighted depths of nodes with at most one child.
Keywords
Cite
@article{arxiv.1707.00165,
title = {On weighted depths in random binary search trees},
author = {Rafik Aguech and Anis Amri and Henning Sulzbach},
journal= {arXiv preprint arXiv:1707.00165},
year = {2017}
}