A Best Possible Bound for The Weighted Path Length of Binary Search Trees (Q4136557)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Best Possible Bound for The Weighted Path Length of Binary Search Trees |
scientific article; zbMATH DE number 3564328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Best Possible Bound for The Weighted Path Length of Binary Search Trees |
scientific article; zbMATH DE number 3564328 |
Statements
A Best Possible Bound for The Weighted Path Length of Binary Search Trees (English)
0 references
1977
0 references
