A note on the expected path length of trees with known fringe (Q1350914): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(96)00129-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026003143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal path length of binary 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: Minimal path length of trees with known fringe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Upper and Lower Bounds on the Path Length of Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the path length of binary 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: Upper Bounds for the Total Path Length of Binary Trees / rank
 
Normal rank

Latest revision as of 10:07, 27 May 2024

scientific article
Language Label Description Also known as
English
A note on the expected path length of trees with known fringe
scientific article

    Statements

    A note on the expected path length of trees with known fringe (English)
    0 references
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    Algorithms and data structures
    0 references
    Binary trees
    0 references
    Path length
    0 references

    Identifiers