This is a preview. Log in through your library . Abstract This paper studies path lengths in random binary search trees under the random permutation model. It is known that the total path length, when ...

Abstract Diamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families ...