A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME (Q4886313)

From MaRDI portal
scientific article; zbMATH DE number 911952
Language Label Description Also known as
English
A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
scientific article; zbMATH DE number 911952

    Statements

    A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME (English)
    0 references
    0 references
    11 December 1996
    0 references
    0 references
    balanced search tree
    0 references
    optimal query time
    0 references
    bucketing
    0 references
    preventive splitting
    0 references
    0 references