A q-analogue of the path length of binary search trees

Details A q-analogue of the path length of binary search trees A q-analogue of the path length of binary search trees

1999-10-14

arxiv.org/abs/math/9910070v1

Mathematics

Combinatorics

Scientific paper

A reformulation of the path length of binary search trees is given in terms
of permutations, allowing to extend the definition to the instance of words,
where the letters are obtained by independent geometric random variables (with
parameter q). In this way, expressions for expectation and variance are
obtained which in the limit for $q\to1$ are the classical expressions.

Affiliated with

Also associated with

No associations

Rating

A q-analogue of the path length of binary search trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A q-analogue of the path length of binary search trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A q-analogue of the path length of binary search trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-105917