A note on the largest number of red nodes in red-black trees (Q2397154): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1406.3092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced search trees made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric binary B-trees: Data structure and maintenance algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRUCTING RED-BLACK TREE SHAPES / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of heaps and its applications / rank
 
Normal rank

Latest revision as of 21:06, 13 July 2024

scientific article
Language Label Description Also known as
English
A note on the largest number of red nodes in red-black trees
scientific article

    Statements

    A note on the largest number of red nodes in red-black trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2017
    0 references
    red-black trees
    0 references
    red internal nodes
    0 references
    dynamic programming
    0 references
    explicit solutions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references