On binary search trees (Q2366072): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3792452 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3994535 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Computer Search Trees and Variable-Length Alphabetical Codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nearly optimal binary search trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Best Possible Bound for The Weighted Path Length of Binary Search Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3358643 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90212-r / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022352965 / rank | |||
Normal rank | |||
Latest revision as of 11:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On binary search trees |
scientific article |
Statements
On binary search trees (English)
0 references
29 June 1993
0 references
average search time
0 references
binary search trees
0 references
