Self-Adjusting Binary Search Trees

Journal of the ACM (JACM)

Volumn 32, Issue 3, 1985, Pages 652-686

  Sleator, Daniel Dominic ^a   Tarjan, Robert Endre ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - TREES;

MULTIDIMENSIONAL SEARCHING; SELF-ADJUSTING BINARY SEARCH TREES; SELF-ORGANIZING DATA STRUCTURES; SPLAY TREES;

DATA PROCESSING;

EID: 0022093855     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/3828.3835     Document Type: Article

References (35)

1. ABRAMSON, N. Information Theory and Coding. McGraw-Hill, New York, 1983.
2. AHO, A.V., HOPCROFT, J.E., AND ULLMAN, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
3. ALLEN, B., AND MUNRO, I. Self-organizing search trees. J. ACM 25, 4 (Oct. 1978), 526-535.
4. BAYER, R. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Inf 1 (1972), 290-306.
5. BAYER, R., AND MCCREIGHT, E. Organization of large ordered indexes. Acta Inf 1 (1972), 173-189.
6. BENT, SW., SLEATOR, D.D., AND TARJAN, R.E. Biased 2-3 trees. In Proceedings of the 2lst Annual IEEE Symposium on Foundations of Computer Science (Syracuse, N.Y., Oct.). IEEE, New York, 1980, pp. 248-254.
7. BENT, S.W., SLEATOR, D.D., AND TARJAN, R.E. Biased search trees. SIAM J. Comput. To be published.
8. BENTLEY, J.L., AND MCGEOGH, C. Worst-case analysis of self-organizing sequential search heuristics. Submitted for publication.
9. BITNER, J.R. Heuristics that dynamically organize data structures. SIAM J. Comput. 8 (1979), 82-110.
10. BROWN, M.R., AND TARJAN, R.E. Design and analysis of a data structure for representing sorted lists. SIAM J. Comput 9 (1980), 594-6 14.
11. DIJKSTRA, E.W. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J., 1976.
12. FEIGENBAUM, J., AND TARJAN, R.E. Two new kinds of biased search trees. Bell Syst. Tech. J. 62 (1983) 3139-3158.
13. GOTING, H., AND KRIEGEL, H.P. Multidimensional B-tree: An efficient dynamic file structure for exact match queries. In Proceedings of the 10th Gesellschaft fir Informatik Annual Conference. Informatik-Fachberichte, vol. 33. Springer-Verlag, New York, 1980, pp. 375-388.
14. Hu, T.C., AND TUCKER, A.C. Optimal computer-search trees and variable-length alphabetic codes. SIAM J. Appl. Math. 37 (1979), 246-256.
15. HUDDLESTON, S. An improved bound on the performance of self-adjusting search trees. Unpublished research note, Computer Science Dept., Univ. of California, Irvine, Calif., 1983.
16. HUDDLESTON, S., AND MEHLHORN, K. Robust balancing in B-trees. In Theoretical Computer Science: 5th G&Conference (Karlseuhe, West Germany, March 23-25). Lecture Notes in Computer Science, vol. 104. Springer-Verlag, Berlin, 1981, pp. 234-244.
17. HUDDLESTON, S., AND MEHLHORN,K. A new data structure for representing sorted lists. Acta Inf 17(1982), 157-184.
18. KNUTH, D.E. Optimum binary search trees. Acta Inf 1 (1971), 14-25.
19. KNUTH, D.E. The Art of Computer Programming. Vol. 1, Fundamental Algorithms, 2nd ed. Addison-Wesley, Reading, Mass., 1973.
20. KNUTH, D.E. The Art of Computer Programming. Vol. 3, Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
21. KOSARAJU, S.R. Localized search in sorted lists. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing (Milwaukee, Wis., May 11-13). ACM, New York, 1981, pp. 62-69.
22. MAIER, D., AND SALVETER, S. Hysterical B-trees. Inf: Proc. Lett. 12 (198 I), 199-202.
23. MEHLHORN, K. Dynamic binary search trees. SIAM J. Comput. 8 (1979), 175-198.
24. NIEVERGELT, J., AND REINGOLD,E. M. Binary search trees of bounded balance. SIAM J. Comput. 2 (1973), 33-43.
25. SLEATOR, D.D. An O(nm log n) algorithm for maximum network flow. Tech. Rep. STAN-CS-10-831. Computer Science Dept., Stanford Univ., Stanford, Calif., 1980.
26. SLEATOR, D.D., AND TARJAN, RX. Self-adjusting binary trees. In Proceedings of the 15th Annual ACM Symposium on Theory of Cbmputing (Boston, Mass., Apr. 25-27). ACM, New York, 1983, 235-245.
27. SLEATOR, D.D., AND TARJAN, R.E. A data structure for dynamic trees. J. Comp. Syst. Sci. 26 (1983), 362-391.
28. SLEATOR, D.D., AND TARJAN, R.E. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (Feb. 1985), 202-208.
29. SLEATOR, D.D., AND TARJAN, R.E. Self-adjusting heaps. SIAM J. Comput. To be published.
30. STEPHENSON, C. J. A method for constructing binary search trees by making insertions at the root. Int. J. Comput. Inf: Sci. 9 (1980), 15-29.
31. TARJAN, R.E. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2 (1975), 215-225.
32. TARJAN, R.E. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pa., 1983.
33. TARJAN, R.E. Amortized computational complexity. SIAM J. Appl. Discrete Meth. 6 (1985), 306-318.
34. TARJAN, R.E. Sequential access in splay trees takes linear time. Combinatorics, to be published.
35. TARJAN, R.E., AND VAN LEEUWEN, J. Worst-case analysis of set union algorithms. J. ACM 31, 2 (Apr. 1984), 245-281.