Optimal binary search trees

Theoretical Computer Science

Volumn 188, Issue 1-2, 1997, Pages 1-44

  Nagaraj, S V ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Binary search tree; Data structures; Optimal binary search tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INFORMATION RETRIEVAL; OPTIMIZATION; PROBABILITY; TREES (MATHEMATICS);

OPTIMAL BINARY SEARCH TREES;

DATA STRUCTURES;

EID: 0031268988     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00320-9     Document Type: Article

References (164)

1. J. Abrahams, Parallelized Huffman and Hu-Tucker searching, IEEE Trans. Inform. Theory 40 (1994).
2. E.N. Adams, Another representation of binary tree traversal, Inform. Processing Lett. 2 (1973) 52-54.
3. G.M. Adel'son-Vel'skii and E.M. Landis, An algorithm for the organization of information, Sov. Math. Dokl. 3 (1962) 1259-1263.
4. R. Ahlswede and I. Wegener, Search Problems (Wiley, New York, 1987).
5. M. Aigner, Combinatorial Search (Wiley-Teubner, New york, 1988).
6. H. Akdag, Performances of an algorithm constructing a nearly optimal binary tree, Acta Inform. 20 (1983) 121-132.
7. B. Allen, On binary search trees, Research Report CS-77-27, Department of Computer Science, University of Waterloo, Waterloo, September 1977.
8. B. Allen, On the costs of optimal and near-optimal binary search trees, Acta Inform. 18 (1982) 255-263.
9. B. Allen and I. Munro, Self-organising binary search trees, in: Proc. 17th Ann. IEEE Symp. on Foundations of Computer Science (1976) 166-172.
10. B. Allen and I. Munro, Self-organizing binary search trees, J. ACM 25 (1978) 526-535.
11. A. Andersson, C. Icking, R. Klein and T. Ottman, Binary search trees of almost optimal height, Acta Inform. 28 (1990) 165-178.
12. A. Andersson, A note on searching in a binary search tree, Software-Practice Experience 21 (1991) 1125-1128.
13. Ashok Subramanian, Design and analysis of algorithms, Tech. Report IISC-CSA-93-01 Dept. of Computer Science, Indian Institute of Science, Bangalore, April 1993.
14. P.J. Bayer, Improved bounds on the cost of optimal and balanced binary search trees, M. Sc. Thesis, Massachusetts Institute of Technology, Cambridge, 1975.
15. J. Bell and G. Gupta, An evaluation of self-adjusting binary search tree techniques, Software-Practice Experience 23 (1993) 369-382.
16. J.L. Bentley, Multidimensional binary search trees used for associative searching, Comm. ACM 18 (1975) 509-517.
17. A. Berztiss, A taxonomy of binary tree traversals, BIT (1987).
18. C. Blundo and R. de Prisco, New bounds on the expected length of one-to-one codes, IEEE Trans. Inform. Theory 42 (1996) 246-249.
19. W.H. Burge, An analysis of binary search trees formed from sequences of non-distinct keys, J. ACM 23 (1976) 451-454.
20. R.M. Capocelli and A. de Santis, Improved bounds on the redundancy of Huffman codes, IBM Tech. Report, RC-14151, October 1988.
21. R.M. Capocelli and A. de Santis, A note on d-ary Huffman codes, IEEE Trans. Inform. Theory 37 (1991) 174-179.
22. R.M. Capocelli and A. de Santis, New bounds on the redundancy of Huffman codes, IEEE Trans. Inform. Theory 37 (1991) 1095-1104.
23. R.M. Capocelli and A. de Santis, Variations on a theme by Gallager, in: J.A. Storer ed., Image and Text Compression (Kluwer, Dordrecht, 1992) 181-213.
24. H. Chang and S. Sitharama Iyengar, Efficient algorithms to globally balance a binary search tree, Comm. ACM 27 (1984) 695-702.
25. R.P. Cheetham, B.J. Oomen and D.T.H. Ng, On using conditional rotation operations to adaptively structure binary search trees, in: Proc. 2nd Internat. Conf. on Database Theory, Lecture Notes in Computer Science, Vol. 326 (Springer, Berlin, 1988) 161-175.
26. G. Chen, M.S. Yu and L.T. Liu, Two algorithms for constructing a binary tree from its traversals, Inform. Proc. Lett. 28 (1988) 297-299.
27. D. Cohen and M.L. Fredman, Weighted binary trees for concurrent searching, J. Algorithms 20 (1996) 87-112.
28. J. Cooper and S.G. Akl, Efficient selection on a binary tree, Inform. Processing Lett. 23 (1986) 123-126.
29. D. Coppersmith, M.M. Klawe and N.J. Pippenger, Alphabetic minimax trees of degree at most t, SIAM J. Comput. 15 (1986) 189-192.
30. J. Culberson, The effect of updates in binary search trees, in: Proc. 17th Ann. ACM Symp. on Theory of Computing (1985) 6-8.
31. J.C. Culberson and J.I. Munro, Analysis of the standard deletion algorithms in exact fit domain binary search trees, Algorithmica 5 (1990) 295-311.
32. W. Cunto and J.L. Gascon, Improving time and space efficiency in generalised binary search trees, Acta Inform. 24 (1987) 583-594.
33. A.C. Day, Balancing a binary tree, Comput. J. 19 (1976).
34. L. Devroye, A note on the height of binary search trees, J. ACM 33 (1986) 489-498.
35. L. Devroye and J.M. Robson, On the generation of random binary search trees, SIAM J. Comput. 24 (1995) 1141-1156.
36. L. Devroye and B. Reed, On the variance of the height of random binary search trees, SIAM J. Comput. 24 (1995) 1157-1162.
37. M.C. Er, A new algorithm for generating binary trees using rotations, Comput. J. 32 (1989) 470-473.
38. Fenner and Loizou, A study of binary tree traversal algorithms and a tag-free threaded representation, Internat. J. Comput. Math. 20 (1986).
39. Filho, Optimal choice of discriminators in a balanced k-d binary search tree, Inform. Processing Lett. 13 (1981).
40. A.S. Fraenkel and S.T. Klein, Bounding the depth of search trees, Comput. J. 36 (1993) 668-678.
41. M.R. Garey, Optimal binary identification procedures, SIAM J. Appl. Math. 23 (1972) 173-186.
42. M.R. Garey, Optimal binary search trees with restricted maximal depth, SIAM J. Comput. 3 (1974) 101-110.
43. A.M. Garsia and M.L. Wachs, A new algorithm for minimum cost binary trees, SIAM J. Comput. 6 (1977) 622-642.
44. N. Gabrani and P. Shankar, A note on the reconstruction of a binary tree from its traversals, Inform. Processing Lett. 42 (1992) 117-119.
45. R.G. Gallager, Variations on a theme of Huffman, IEEE Trans. Inform. Theory 24 (1978) 668-674.
46. T.E. Gerasch, An insertion algorithm for a minimal internal path length binary search tree, Comm. ACM 31 (1988) 579-585.
47. E.N. Gilbert, Codes based on inaccurate source probabilities, IEEE Trans. Inform. Theory 17 (1971) 304-314.
48. E.N. Gilbert and E.F. Moore, Variable length binary encodings, Bell System Tech. J. 38 (1959) 933-968.
49. J. Glenn, Binary trees, Tech. Report DCS-TR86-127, Dept. of Computer Science, Dartmouth College, Hanover, NH, 1986.
50. S.W. Golomb, Sources which maximize the choice of a Huffman coding tree, Inform. and Control 45 (1980) 263-272.
51. D. Gries and J.L.A. van de Snepscheut, Inorder traversal of a binary tree and its inversion, in: E.W. Dijkstra, ed., Formal Development of Programs and Proofs (Addison-Wesley, Reading, MA, 1990).
52. L.J. Guibas, A principle of independence for binary tree searching, Acta Inform. 4 (1974) 293-298.
53. R. Guttler, K. Mehlhorn and W. Scneider, Binary search trees: average and worst case behaviour, Elektron. Informat. Kybernet. 16 (1980) 41-61.
54. E.N. Hanson, The interval skip list: a data structure for finding all intervals that overlap a point, Tech. Report WSU-CS-91-01, Washington State University, 1991.
55. E.N. Hanson and M. Chaabouni, The IBS-tree: A data structure for finding all intervals that overlap a point, Tech. Report WSU-CS-90-11, Washington State University, 1990.
56. F. Harary, E.M. Palmer and R.W. Robinson, Counting free binary trees admitting a given height, Tech, Report UGA-CS-TR-90-001, University of Georgia, 1990.
57. J.H. Hester and D.S. Hirschberg, Generation of optimal binary split trees, Tech. Report UCI/ICS-TR-85-13, Department of Information and Computer Science, University of California, Irvine, March 1985.
58. T.N. Hibbard, Some combinatorial properties of certain trees with applications to sorting and searching, J. ACM 9 (1962) 13-28.
59. T. Hikita, Listing and counting subtrees of equal size of a binary tree, Inform. Processing Lett. 17 (1983) 225-229.
60. D.S. Hirschberg, L.L. Larmore and M. Moldowitch, Subtree weight ratios for optimal binary search trees, Tech. Report 86-02 ICS Dept. Univ. of Calif. Irvine, 1986.
61. Y. Horibe, An improved bound for weight balanced trees, Inform. and Control 34 (1977) 148-151.
62. Y. Horibe and T.O.H. Nemetz, On the max-entropy rule for a binary search tree, Acta Inform. 12 (1979) 63-72.
63. T.C. Hu, A new proof of the T-C algorithm, SIAM J. Appl. Math. 25 (1973) 83-94.
64. T.C. Hu, Combinatorial Algorithms (Addison-Wesley, Reading, MA, 1982).
65. T.C. Hu, D.J. Kleitman and J.K. Tamaki, Binary trees optimum under various criteria, SIAM J. Appl. Math. 37 (1979) 246-256.
66. T.C. Hu and K.C. Tan, Least upper bound on the cost of optimal binary search trees, Acta Inform. 1 (1972) 307-310.
67. T.C. Hu and K.C. Tan, Path lengths of binary search trees, SIAM J. Appl. Math. 22 (1972) 225-234.
68. T.C. Hu and A.C. Tucker, Optimal computer search trees and variable length alphabetic codes, SIAM J. Appl. Math. 21 (1971) 514-532.
69. D.A. Huffman, A method for the construction of minimum redundancy codes, Proc. IRE 40 (1952) 1098-1101.
70. A. Itai, Optimal alphabetic trees, SIAM J. Comput. 5 (1976) 9-18.
71. G. Jacobson, Succinct static data structures, Tech. Report CMU-CS-89-112 Dept. of Computer Science Carnegie-Mellon University, January 1989.
72. V. Kamakoti and C.P. Rangan, An optimal algorithm for reconstructing a binary tree, Inform. Processing Lett. 42 (1992) 113-115.
73. P.C. Karlton, S.H. Fuller, R.E. Scroggs and E.B. Kaehler, Performance of height-balanced trees, Comm. ACM 19 (1976)
74. M. Karpinski, L.L. Larmore and W. Rytter, Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees, in: Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms (1996) 36-41.
75. G.O.H. Katona and T.O.H. Nemetz, Huffman codes and self-information, IEEE Trans. Inform. Theory 22 (1976) 337-340.
76. R. Kemp, Binary search trees constructed from nondistinct keys with/without specified probabilities, Theoret. Comput. Sci. 156 (1989) 181-203.
77. A.C. Kilgour, Generalized nonrecursive traversal of binary trees, Software-Practice Experience 11 (1981) 1299-1306.
78. J.H. Kingston, A new proof of the Garsia-Wachs algorithm, J. Algorithms 9 (1988) 129-136.
79. D.G. Kirkpatrick and M. Klawe, Alphabetic minimax trees, SIAM J. Comput. 14 (1985) 514-526.
80. M. Klawe and B. Mumey, Upper and lower bounds on constructing alphabetic binary trees, in: Proc. 4th Ann. ACM-SIAM Symp. on Discrete Algorithms (1993) 185-193.
81. R. Klein and D. Wood, On the path length of binary trees, J. ACM 36 (1989) 280-289.
82. G.D. Knott, A balanced tree storage and retrieval algorithm, in: Proc. ACM Symp. on Inform. Storage and Retrieval (1971).
83. G.D. Knott, A numbering system for binary trees, Comm. ACM 20 (1977) 113-115.
84. D.E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms (Addison-Wesley, Reading, MA, 1968).
85. D.E. Knuth, Optimum binary search trees, Acta Inform. 1 (1971) 14-25.
86. D.E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching (Addison-Wesley, Reading, MA, 1973).
87. D.E. Knuth, Dynamic Huffman coding, J. Algorithms 6 (1985) 163-180.
88. A.P. Korah and M.R. Kaimal, Dynamic optimal binary search tree, Internat. J. Found. Comput. Sci. 1 (1990) 449-463.
89. C.H.A. Koster and Th.P. van der Weide, Hairy search trees, Comput. J. 38 (1995) 691-694.
90. D.C. Kozen, Design and analysis of algorithms (Springer, New York, 1992).
91. H.T. Kung and P.L. Lehman, Concurrent manipulation of binary search trees, ACM Trans. Database Systems 5 (1980) 354-382.
92. T.W. Lai and D. Wood, Adaptive heuristics for binary search trees and constant linkage cost, in: Proc. 2nd Ann. ACM-SIAM Symp. on Discrete Algorithms (1991) 28-30.
93. C.E. Langenhop and W.E. Wright, Probabilities related to father-son distances in binary search trees, SIAM J. Comput. 15 (1986) 520-530.
94. L.L. Larmore, A subquadratic algorithm for constructing approximately optimal binary search trees, Tech. Report UCI//ICS-TR-86-03, Department of Information and Computer Science, University of California, Irvine, February 1986.
95. L.L. Larmore, A subquadratic algorithm for constructing approximately optimal binary search trees, J. Algorithms 8 (1987) 579-591.
96. L.L. Larmore, Length limited coding and optimal height-limited binary trees, Tech. Report UCI//ICS-TR-88-01, Dept. of Information and Computer Science, University of California, Irvine, March 1989.
97. L.L. Larmore and D.S. Hirschberg, A fast algorithm for optimal length-limited Huffman codes, J. ACM 37 (1990) 464-473.
98. L.L. Larmore and T.M. Przytycka, The optimal alphabetic tree problem revisited, in: Proc. Internat. Coll. on Automata Languages and Programming, ICALP 94 (1994).
99. L.L. Larmore and T.M. Przytycka, Constructing Huffman trees in parallel, SIAM J. Comput. 24 (1995) 1163-1169.
100. L.L. Larmore and T.M. Przytycka, A parallel algorithm for optimum height-limited alphabetic binary trees, J. Parallel Distri. Comput. 35 (1996) 49-56.
101. D.T. Lee and C.K. Wong, Worst case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees, Acta Inform. 9 (1977) 23-29.
102. C. Levcopoulos, A. Lingas and J. R. Sack, Heuristics for optimum binary search trees and minimum weight triangulation problems, Theoret. Comput. Sci. 66 (1989) 181-203.
103. J.M. Lucas, D.R. van Baronaigien and F. Ruskey, On rotations and the generation of binary trees, J. Algorithms 15 (1993) 343-366.
104. E. Makinen, Left distance binary tree representations, BIT 27 (1987) 163-169.
105. E. Makinen, Constructing a binary tree from its traversals, BIT 29 (1989) 572-578.
106. E. Makinen, A linear time and space algorithm for finding isomorphic subtrees of a binary tree, BIT 31 (1991).
107. E. Makinen, A note on Gupta's binary tree codings, Bull. EATCS 49 (1993).
108. G. Markowsky, Best Huffman codes, Acta Inform. 16 (1981) 363-370.
109. H.W. Martin and B.J. Or, A random binary tree generator, in: Proc. 17th Ann. ACM Computer Science Conf., Louisville, KY (1989) 37-38.
110. K. Mehlhorn, Nearly optimal binary search trees, Acta Inform. 5 (1975) 287-295.
111. K. Mehlhorn, A best possible bound for the weighted path length of binary search trees, SIAM J. Comput. 6 (1977) 235-239.
112. K. Mehlhorn, Dynamic binary search, SIAM J. Comput. 8 (1979) 175-198.
113. K. Mehlhorn, Data structures and algorithms Vol. 1: Sorting and Searching, EATCS Monographs on Theoretical Computer Science (Springer, Berlin, 1984).
114. K. Mehlhorn and A. Tsakalidis, Data Structures, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier, Amsterdam, 1990) 303-341.
115. A. Moitra and S. Sitharama Iyengar, Derivation of a maximally parallel algorithm for balancing binary search trees, Tech. Report TR 84-638, Dept. of Computer Science Cornell University, Ithaca, New York, September 1984.
116. B.M. Mumey, Some new results for constructing optimal alphabetic binary trees, M. Sc. Thesis, Univ. of British Columbia, Canada, 1992.
117. J.I. Munro and P.V. Poblete, A discipline for robustness or storage reduction in binary search trees, in: Proc. 2nd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems (1983) 21-23.
118. J.I. Munro and P.V. Poblete, Fault tolerance and storage reduction in binary search trees, Inform. and Control 62 (1984) 210-218.
119. J. Nievergelt, Binary search trees and file organisation, ACM Comput. Surveys 6 (1974) 195-207.
120. J. Nievergelt and E.M. Riengold, Binary search trees of bounded balance, in: Proc. 4th Ann. ACM Symp. on Theory of Computing (1972) 1-3.
121. J. Nievergelt and E.M. Riengold, Binary search trees of bounded balance, SIAM J. Comput. 21 (1973) 33-43.
122. J. Nievergelt and C.K. Wong, Upper bounds for the total path length of binary trees, J. ACM 20 (1973) 1-6.
123. O. Nurmi and E. Soisalon-Soininen, Uncoupling updating and rebalancing in chromatic binary search trees, in: Proc. 10th ACM SIGACT-SIGART Symp. on Principles of Database Systems (1991) 29-31.
124. S. Olariu, C. Overstreet and Z. Wen, An optimal parallel algorithm to reconstruct a binary tree from its traversals, in: Proc. Advances in Computing and Information-ICCI: Internat. Conf. on Computing and Information, Lecture Notes in Computer Science, Vol. 497 (Springer, New York, 1991) 484-495
125. S. Olariu, C. Overstreet and Z. Wen, Reconstructing a binary tree from its traversals in doubly logarithmic CREW time, J. Parallel Distri. Comput. 21 (1995).
126. Ottmann and Wood, How to update a balanced binary tree with a constant number of rotations, in: Proc. Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science (Springer, New York, 1990).
127. J.M. Pallo, Enumerating ranking and unranking binary trees, Comput. J. 29 (1986).
128. P. V. Poblete and J. I. Munro, The analysis of a fringe heuristic for binary search trees, J. Algorithms 6 (1985) 336-350.
129. R. de Prisco and A. de Santis, On binary search trees, Inform. Proc. Lett. 45 (1993) 249-253.
130. R. de Prisco and A. de Santis, New lower bounds on the cost of binary search trees, Theoret. Comput. Sci. 156 (1996) 315-325.
131. R. de Prisco and A. de Santis, On the redundancy achieved by Huffman codes, Inform. Sci. 88 (1996) 131-148.
132. R. de Prisco, G. Parlati and G. Persiano, Minimal path length of binary trees, Theoret. Comput. Sci 143 (1995) 175-188.
133. R. de Prisco and G. Persiano, Characteristic inequalities for binary trees, Inform. Processing Lett. 53 (1995) 201-207.
134. A. Proskurowski, On the generation of binary trees, J. ACM 27 (1980) 1-2.
135. A. Proskurowski and F. Ruskey, Binary tree gray codes, J. Algorithms 6 (1985) 225-238.
136. K.J. Raeihae and S.H. Zweben, An optimal insertion algorithm for one-sided height-balanced binary search trees, Comm. ACM 22 (1979) 508-512.
137. P. Ramanan, Testing the optimality of alphabetic trees, Theoret. Comput. Sci. 93 (1992) 279-301.
138. Ramarao, O(log N) parallel algorithms for binary tree traversals, in: Proc. 22th Ann. Allerton Conf. on Commun. Control and Comput. (Allerton House, Monticello, IL, 1984).
139. J. Rissanen, Bounds for weighted balanced trees, IBM J. Res. Develop. (1973) 101-105.
140. F. Ruskey, Generating t-ary trees lexicographically, SIAM J. Comput. 7 (1978) 424-439.
141. F. Ruskey and T.C. Hu, Generating binary trees lexicographically, SIAM J. Comput. 6 (1977) 745-758.
142. A. de Santis and G. Persiano, Tight upper and lower bounds on the path length of binary trees, SIAM J. Comput. 23 (1994) 12-23.
143. E.S. Schwartz, An optimum encoding with minimum longest code and total number of digits, Inform. and Control 7 (1964) 37-44.
144. E.S. Schwartz and B. Kallick, Generating a canonical prefix encoding, Comm. ACM 7 (1964) 166-169.
145. D.D. Sleator and R.E. Tarjan, Self-adjusting binary search trees, J. ACM 32 (1985) 652-686.
146. M. Solomon and R.A. Finkel, A note on enumerating binary trees, J. ACM 27 (1980) 3-5.
147. D. Spuler, The optimal binary search tree for Andersson's search algorithm, Acta Inform. 30 (1993) 405-407.
148. A. E. Trojanowski, Ranking and listing algorithms for k-ary trees, SIAM J. Comput. 1 (1978) 492-509.
149. Troutman and Karlinger, A note on subtrees rooted along the primary path of a binary tree, Discrete Appl. Math. Comb. Oper. Res. Comput. Sci. 42 (1993).
150. K. Unterauer, Dynamic weighted binary search trees, Acta Inform. 11 (1979) 341-362.
151. D.R. van Baronaigien, A loopless algorithm for generating binary tree sequences, Inform. Processing Lett. 39 (1991) 189-194.
152. P. van Emde Boas, An O(n log log n) on-line algorithm for the insert-extract min problem, Tech. Report TR 74-221, Dept. of Computer Science Cornell University, December 1974.
153. J.G. Vaucher, Pretty-printing of trees, Software-Practice Experience 10 (1980) 553-561.
154. J. Vuillemin, A data structure for manipulating priority queues, Comm. ACM 21 (1978) 309-315.
155. W.A. Walker and C.C. Gotlieb, A top-down algorithm for constructing nearly optimal lexicographic trees, in: Graph Theory and Computing (Academic Press, New York, 1972) 303-323.
156. R.L. Wessner, Optimal alphabetic search trees with restricted maximal height, Inform. Processing Lett. 4 (1976) 90-94.
157. R. Wilber, Lower bound for accessing binary search trees with rotations, in: Proc. 27th Ann. Sympo. Found. Comput. Sci. (1986) 27-29.
158. R. Wilber, Lower bounds for accessing binary search trees with rotations, SIAM J. Comput 18 (1989) 56-57.
159. W.E. Wright, Binary search trees in secondary memory, Acta Inform. 15 (1981) 3-17.
160. F.F. Yao, Efficient dynamic programming using quadrangle inequalities, in: Proc. 12th Ann. ACM Sympo. on Theory of Computing (1980) 429-435.
161. F.F. Yao, Speed-up in dynamic programming, SIAM J. Alg. Discrete Math. 3 (1982) 532-540.
162. R.W. Yeung, Alphabetic codes revisited, IEEE Trans. Inform. Theory 37 (1991) 564-572.
163. R.W. Yeung, Local redundancy and progressive bounds on the expected length of a Huffman code, IEEE Trans. Inform. Theory 37 (1991) 687-691.
164. J.M. Yohe, Hu-Tucker minimum redundancy alphabetic coding method, Comm. ACM 15 (1972) 360-362.