Binary search trees with binary comparison cost (Q3335002): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:47, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binary search trees with binary comparison cost |
scientific article |
Statements
Binary search trees with binary comparison cost (English)
0 references
1984
0 references
comparison cost
0 references
node visit cost
0 references
stratified trees
0 references
Fibonacci trees
0 references
binary search trees
0 references
binary trees
0 references
balanced search trees
0 references
balanced biased trees
0 references
height-balanced trees
0 references
