Tree Rebalancing in Optimal Time and Space

@article{Stout1986TreeRI,
  title={Tree Rebalancing in Optimal Time and Space},
  author={Quentin F. Stout and Bette L. Warren},
  journal={Commun. ACM},
  year={1986},
  volume={29},
  pages={902-908}
}
A simple algorithm is given which takes an arbitrary binary search tree and rebalances it to form another of optimal shape, using time linear in the number of nodes and only a constant amount of space (beyond that used to store the initial tree). This algorithm is therefore optimal in its use of both time and space. Previous algorithms were optimal in at most one of these two measures, or were not applicable to all binary search trees. When the nodes of the tree are stored in an array, a simple… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.

131 Citations

01020'88'95'03'11'19
Citations per Year
Semantic Scholar estimates that this publication has 131 citations based on the available data.

See our FAQ for additional information.

References

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

Balancing a binary tree. Compur

  • A. C. Day
  • (Nov
  • 1976
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…