Optimizing binary trees grown with a sorting algorithm

DOI10.1145/361254.361259MaRDI QIDQ5637873zbMATH OpenOpenAlexFDO

Authors

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)

Cited in

(4)

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

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

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