WEN-CHIN CHENNi, Wen-ChunWen-ChunNi2009-04-292018-07-052009-04-292018-07-05199400200190http://ntur.lib.ntu.edu.tw//handle/246246/154493https://www.scopus.com/inward/record.uri?eid=2-s2.0-0028485196&doi=10.1016%2f0020-0190%2894%2900081-6&partnerID=40&md5=0256f1b63352fd5cab7416384adcb151We 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.application/pdf250815 bytesapplication/pdfen-USAlgorithms; Combinatorial enumeration; Data structures; Generating functions; Heap-ordered trees; Internal path length; ProbabilityAlgorithms; 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 sequencesjournal article10.1016/0020-0190(94)00081-62-s2.0-0028485196http://ntur.lib.ntu.edu.tw/bitstream/246246/154493/1/06.pdf