On the Average Altitude of Heap-Ordered Trees (original) (raw)

International Journal of Foundations of Computer Science, 1994

Abstract

We consider heap-ordered trees in this paper. The main theorems in this paper show that the average and the variance of the altitude (or level) of the nodes in a random n-node heap-ordered tree are [Formula: see text] and [Formula: see text], respectively where γ=0.5772156649… is the Euler’s constant.

Wen-chin Chen hasn't uploaded this paper.

Let Wen-chin know you want this paper to be uploaded.

Ask for this paper to be uploaded.