Query costs in HB(1) trees versus 2?3 trees (Q3940859)

From MaRDI portal
Revision as of 22:31, 20 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Query costs in HB(1) trees versus 2?3 trees
scientific article

    Statements

    title
    Query costs in HB(1) trees versus 2?3 trees (English)
    0 references
    DOI
    10.1007/BF00996136
    0 references
    author
    Ahmed S. Zaki
    0 references
    Jean-Loup Baer
    0 references
    publication date
    1981
    0 references
    zbMATH DE Number
    3757719
    0 references
    zbMATH Keywords
    binary search trees
    0 references
    AVL trees
    0 references
    tree height
    0 references
    dense and sparse nodes
    0 references
    key comparison
    0 references
    node visit
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3940859&oldid=8370966"
      Powered by MediaWiki