A note on growing binary trees

DOI10.1016/0012-365X(73)90114-3MaRDI QIDQ2555859zbMATH OpenFDO

Authors Alan G. Konheim, Donald J. Newman

Publication date 1973

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Search theory (90B40)

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
• Two inequalities implied by unique decipherability

Cited in

(5)

• Weighted height of random trees
• Multiple choice tries and distributed hash tables
• The expected profile of digital search trees
• Node profiles of symmetric digital search trees: Concentration properties
• On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach

This page was built for publication: A note on growing binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2555859)