A note on growing binary trees

DOI10.1016/0012-365X(73)90114-3zbMath0247.05105MaRDI QIDQ2555859

Alan G. Konheim, Donald J. Newman

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (5)

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

Cites Work

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

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