Binary search trees with binary comparison cost (Q3335002)
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: Binary search trees with binary comparison cost |
scientific article; zbMATH DE number 3868633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary search trees with binary comparison cost |
scientific article; zbMATH DE number 3868633 |
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
0.8381720185279846
0 references
0.8289009928703308
0 references
0.8279104828834534
0 references
0.8269302248954773
0 references
0.824138879776001
0 references
