Optimum ordered bi-weighted binary trees

DOI10.1016/0020-0190(83)90071-6zbMATH Open0519.90090OpenAlexW2017355568MaRDI QIDQ1055348FDOQ1055348

Man-tak Shing

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90071-6

zbMATH Keywords

binary search treesoptimum ordered bi-weighted binary treeweighted path length

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39)

Cited In (2)

• Dynamic programming and graph optimization problems
• Operations research applications of dichotomous search

This page was built for publication: Optimum ordered bi-weighted binary trees

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