An analytic approach to the height of binary search trees. II (Q3452495)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6507909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An analytic approach to the height of binary search trees. II |
scientific article; zbMATH DE number 6507909 |
Statements
An analytic approach to the height of binary search trees II (English)
0 references
12 November 2015
0 references
binary search tree
0 references
average case analysis
0 references
generating functions
0 references
height
0 references
saturation level
0 references
0.9005874991416931
0 references
0.9005874395370483
0 references
0.8894955515861511
0 references
0.8839915990829468
0 references
0.8828016519546509
0 references
