Optimum lopsided binary trees

@article{Kapoor1989OptimumLB,
  title={Optimum lopsided binary trees},
  author={Sanjiv Kapoor and Edward M. Reingold},
  journal={J. ACM},
  year={1989},
  volume={36},
  pages={573-590}
}
Binary search trees with costs α and β, respectively, on the left and right edges (lopsided search trees) are considered. The exact shape, minimum worst-case cost, and minimum average cost of lopsided trees of <italic>n</italic> internal nodes are determined for nonnegative α and β; the costs are both roughly log<subscrpt>p</subscrpt>(<italic>n</italic> + 1) where <italic>p</italic> is the unique real number in the interval (1. 2] satisfying 1/<italic>p</italic><supscrpt>α</supscrpt> + 1… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 27 CITATIONS

(\alpha, \beta) Fibonacci Search

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Lopsided Trees, I: Analyses

VIEW 9 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

An asymptotic theory for recurrence relations based on minimization and maximization

VIEW 5 EXCERPTS
CITES RESULTS
HIGHLY INFLUENCED

Bigtable Merge Compaction

VIEW 2 EXCERPTS
CITES BACKGROUND

On One-to-One Codes for Memoryless Cost Channels

VIEW 1 EXCERPT
CITES BACKGROUND

On the cost of optimal alphabetic code trees with unequal letter costs

VIEW 2 EXCERPTS
CITES BACKGROUND

More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding

VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

An Almost Optimal Algorithm for Unbounded Searching

VIEW 16 EXCERPTS
HIGHLY INFLUENTIAL

Recurrence relations based on minimization

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

A general class of resource tradeoffs

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Optimal α-β trees with capacity constraint

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Bounds for optimalα-β binary trees

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL