Binary search trees with binary comparison cost (Q3335002)

From MaRDI portal
Revision as of 23:54, 3 September 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
Binary search trees with binary comparison cost
scientific article

    Statements

    Binary search trees with binary comparison cost (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    comparison cost
    0 references
    node visit cost
    0 references
    stratified trees
    0 references
    Fibonacci trees
    0 references
    binary search trees
    0 references
    binary trees
    0 references
    balanced search trees
    0 references
    balanced biased trees
    0 references
    height-balanced trees
    0 references