Untangling the balancing and searching of balanced binary search trees

Software - Practice and Experience

Volumn 33, Issue 13, 2003, Pages 1273-1298

  Austern, Matthew H ^a   Stroustrup, Bjarne ^b   Thorup, Mikkel ^c   Wilkinson, John ^d  

^a APPLE INC   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

^c AT AND T LABS RESEARCH   (United States)

^d HEWLETT PACKARD ENTERPRISE   (United States)

Author keywords

Balanced search trees; C++ templates; Generic data structures

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; TREES (MATHEMATICS);

BINARY SEARCH TREES;

DATA STRUCTURES;

EID: 0242334582     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/spe.564     Document Type: Article

References (22)

1. Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to algorithms (2nd edn). MIT Press: Cambridge, MA, 2001.
2. Bayer R. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica 1972; 1:290-306.
3. Guibas LJ, Sedgewick R. A dichromatic framework for balanced trees. Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, Ann Arbor, MI. IEEE, 1978; 8-21.
4. Sleator DD, Tarjan RE. Self-adjusting binary search trees. Journal of the ACM 1985; 32:652-686.
5. Tarjan RT. Data Structures and Network Algorithms. SIAM: Philadelphia, PA, 1983.
6. Aragon CR, Seidel RG. Randomized search trees. Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989; 540-545.
7. Motwani R, Raghavan P. Randomized Algorithms. Cambridge University Press: Cambridge, 1995.
8. Stroustrup B. The C++ Programming Language (Special Edition). Addison-Wesley: Reading, MA, 2000.
9. International Organization for Standardization (ISO), 1 rue de Varembé, Case postale 56, CH-1211 Genève 20, Switzerland. ISO/lEC International Standard 14882: Programming Languages - C++, 1998.
10. Musser DR, Derge GJ, Saini A. STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library, Addison-Wesley: Reading, MA, 2001.
11. Austern MH. Generic Programming and the STL: Using and Extending the C++ Standard Template Library. Addison-Wesley: Reading, MA, 1999.
12. Josuttis NM. The C++ Standard Library: A Tutorial and Reference, Addison-Wesley: Reading, MA, 1999.
13. Sedgewick R. Algorithms in C++ (3rd edn). Addison-Wesley: Reading, MA, 1998.
14. Mehlhorn K, Näher S. LEDA - A Platform for Combinatorial and Geometric Computing. Cambridge University Press: Cambridge, 1999.
15. Bentley JL, Sedgewick R. Fast algorithms for sorting and searching strings. Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, 1996. ACM/SIAM, 1996; 360-369.
16. Bent SW, Sleator DD, Tarjan RE. Biased search trees. SIAM Journal on Computing 1985; 14:545-568.
17. Austern M, Stroustrup B, Thorup M, Wilkinson J. Electronic appendix for untangling the balancing and searching of balanced binary search trees. http://www.cs.tamu.edu/archive/2003/ASTW03_appendix.pdf [June 2003].
18. Van Wyk CJ. Data Structures and C Programs. Addison-Wesley: Reading, MA, 1998.
19. Goodrich MT, Tamassia R. Algorithm Design: Foundations, Analysis and Internet Examples, Wiley: New York, 2002.
20. Stroustrup B. The Design and Evolution of C++. Addison-Wesley: Reading, MA, 1994.
21. Barton JJ, Nackman LR. Scientific and Engineering C++. Addison-Wesley: Reading, MA, 1994.
22. Coplien J. Curiously recurring template patterns. C++ Gems, Lippman SB (ed.). Cambridge University Press: Cambridge, 1996.