An optimal insertion algorithm for one-sided height-balanced binary search trees (Q3048275): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Kari-Jouko Raeihae / rank | |||
| Property / author | |||
| Property / author: Kari-Jouko Raeihae / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q61450096 / rank | |||
Normal rank | |||
| 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.1145/359146.359149 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992675042 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:31, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal insertion algorithm for one-sided height-balanced binary search trees |
scientific article |
Statements
An optimal insertion algorithm for one-sided height-balanced binary search trees (English)
0 references
1979
0 references
optimal insertion algorithm
0 references
one-sided height-balanced binary search trees
0 references
