Internal path length of the binary representation of heap-ordered trees
Journal
Information Processing Letters
Journal Volume
51
Journal Issue
3
Pages
129-132
Date Issued
1994
Date
1994
Author(s)
Ni, Wen-Chun
Abstract
We show that the average internal path length of the binary representation of a random n-node heap-ordered tree is asymptotically n πn-2n + O( n). © 1994.
Subjects
Algorithms; Combinatorial enumeration; Data structures; Generating functions; Heap-ordered trees; Internal path length; Probability
Other Subjects
Algorithms; Combinatorial mathematics; Computer applications; Computer systems; Data structures; Numerical methods; Probability; Queueing theory; Random number generation; Random processes; Trees (mathematics); Combinatorial enumeration; Generating function; Heap ordered trees; Internal path length; Binary sequences
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
06.pdf
Size
244.94 KB
Format
Adobe PDF
Checksum
(MD5):1f96f4403d269aa028f8ed466a16063e