Optimal Binary Trees with Height Restrictions on Left and Right Branches
We begin with background definitions on binary trees. Then we review known algorithms for finding optimal binary search trees. Knuth's famous algorithm, presented in the second chapter, is the cornerstone for our work. It depends on two important results: the Quadrangle Lemma and the Monoticity...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
LSU
2006
|
| Subjects: | |
| Online Access: | http://etd.lsu.edu/docs/available/etd-07122006-160111/ |