AVL-trees for localized search

DOI10.1016/S0019-9958(85)80034-6zbMath0588.68033DBLPjournals/iandc/Tsakalidis85OpenAlexW2079716330WikidataQ29998940 ScholiaQ29998940MaRDI QIDQ3716309

Athanasios K. Tsakalidis

Publication date: 1985

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(85)80034-6

zbMATH Keywords

deletioninsertiondata structuresearchable priority queues

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (6)

A constant update time finger search tree ⋮ Making data structures persistent ⋮ Fully persistent B-trees ⋮ Optimal finger search trees in the pointer machine ⋮ Some Results for Elementary Operations ⋮ Unnamed Item

This page was built for publication: AVL-trees for localized search