Optimum lopsided binary trees (Q4710685)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimum lopsided binary trees |
scientific article; zbMATH DE number 3958 |
Statements
Optimum lopsided binary trees (English)
0 references
25 June 1992
0 references
algorithmic analysis
0 references
binary search trees
0 references
coding theory
0 references
data structure
0 references
edge-weighted trees
0 references
Fibonacci numbers
0 references
Fibonacci trees
0 references
information theory
0 references
Kraft's inequality
0 references
minimax recurrence relations
0 references
optimal trees
0 references
path lengths
0 references
prefix-free codes
0 references
unbounded search
0 references
0.8384674191474915
0 references
0.8266481161117554
0 references
0.824138879776001
0 references
0.8117674589157104
0 references
