Optimizing binary trees grown with a sorting algorithm

DOI10.1145/361254.361259zbMath0229.68006OpenAlexW2001899873MaRDI QIDQ5637873

No author found.

Publication date: 1972

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/48702

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Some ideas of semantic memory in automatic learning of heuristics ⋮ Binary search trees of almost optimal height ⋮ A comparative study of 2-3 trees and AVL trees ⋮ Query costs in HB(1) trees versus 2?3 trees

This page was built for publication: Optimizing binary trees grown with a sorting algorithm