Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (Q2428686)

From MaRDI portal
Revision as of 03:37, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees
scientific article

    Statements

    Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (English)
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    data structures
    0 references
    binary search trees
    0 references
    unordered binary trees
    0 references
    rotations
    0 references
    off-line lower bound
    0 references
    Wilber's theorem
    0 references
    0 references