Exact balancing is not always good
From MaRDI portal
Publication:1072369
DOI10.1016/0020-0190(86)90148-1zbMath0587.68033MaRDI QIDQ1072369
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90148-1
merging; balanced trees; analysis of divide- and-conquer algorithms; optimization problem on binary trees
68R10: Graph theory (including graph drawing) in computer science
68W99: Algorithms in computer science
Related Items
Cites Work