Insertion reachability, skinny skeletons, and path length in red-black trees (Q1328538): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Symmetric binary B-trees: Data structure and maintenance algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense multiway trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the path length of red-black trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight upper bound for the path length of AVL trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3951559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of iterative and defined classes of search trees / rank
 
Normal rank

Latest revision as of 17:03, 22 May 2024

scientific article
Language Label Description Also known as
English
Insertion reachability, skinny skeletons, and path length in red-black trees
scientific article

    Statements

    Insertion reachability, skinny skeletons, and path length in red-black trees (English)
    0 references
    0 references
    0 references
    26 July 1994
    0 references
    0 references
    red-black trees
    0 references
    binary trees
    0 references
    0 references