Optimum lopsided binary trees (Q4710685): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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/65950.65955 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982998010 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:32, 19 March 2024
scientific article; zbMATH DE number 3958
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
