Tight Upper and Lower Bounds on the Path Length of Binary Trees

DOI10.1137/S0097539791197323zbMath0802.68034OpenAlexW2078485082MaRDI QIDQ4286225

Giuseppe Persiano, Alfredo De Santis

Publication date: 27 March 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539791197323

zbMATH Keywords

binary search treespath length

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items

A note on the expected path length of trees with known fringe, Binary trees, fringe thickness and minimum path length, Minimal path length of trees with known fringe, Optimal binary search trees, Fringe thickness and maximum path length of binary trees