Abstract
The combinatorial analysis of the behaviour of various classes of data structures is increasingly becoming amenable to investigation as new techniques are developed. In this paper we survey the results available for search trees with an emphasis on post-Yao results.
Work partially supported by a Natural Sciences and Engineering Research Council of Canada Grant No. A-7700
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Altenkamp,D., and Mehlhorn,K.: Codes: unequal probabilities, unequal letter costs. Universitaet des Saarlandes Computer Science Technical Report A77/13 (1977)
Allen, B., and Munro, J.I.: Self-organizing binary search trees. J. ACM 25 (1978), 526–535
Baer, J.L.: Weight-balanced trees. Proc. AFIPS National Computer Conference 44 (1975), 467–472
Bayer,P.J.: Improved bounds on the costs of optimal and balanced binary search trees. MIT Project MAC Technical Memo. 69 (1975)
Bitner, J.R.: Heuristics that dynamically organize data structures. SIAM J. Comput. 8 (1979), 82–110
Bitner,J.R., and Huang,S.H.: Key comparison optimal 2–3 trees with maximum utilization. University of Texas Computer Science Technical Report No.94 (1979)
Blum,N., and Mehlhorn,K.: On the average number of rebalancing operations in weight-balanced trees. Universitaet des Saarlandes, Computer Science Technical Report A-78/06 (1978)
Bagchi, A., and Roy, J.K.: On V-optimal trees. SIAM J. Comput.8, (1979), 524–541
Brown, M.R.: Implementation and analysis of binomial queue algorithms. SIAM J. Comput. 7 (1978), 298–319
Brown, M.R.: A partial analysis of random height-balanced trees. SIAM J. Comput. 8 (1979), 33–41
Brown, M.R.: Some observations on random 2–3 trees. Information Processing Letters 9 (1979), 57–59
Brown,M.R., and Tarjan,R.E.: Design and analysis of a data structure for representing sorted lists. Stanford University, Computer Science Technical Report (1978)
Bruno,J., and Coffman,E.G.: Nearly optimal binary search trees. IFIP 1971, North-Holland (1972), 99–103
Choy, D.M., and Wong, C.K.: Optimal trees with capacity constraint, Acta Informatica 10, (1978), 273–296
Cot,N.: Characterization and design of optimal prefix codes. Doctoral Dissertation, Stanford University (1977)
Culik II,K., Ottmann,Th., and Wood,D.: Dense multiway trees. University of Karlsruhe, Technical Report No. 77, Inst. f. Ang. Inf. u. Form. Beschr.verf. (1978)
van Doren,J.R.: An asymptotic analysis of minimum order B-trees. Unpublished manuscript, (1976)
Fairley,R.: Unpublished manuscript, (1973)
Flajolet,P., Francon,J., and Vuillemin,J.: Sequence of operations analysis for dynamic data structures. Journal of Algorithms 1 (1980). to appear
Flajolet,P., and Odlyzko,A.: The average height of binary trees and other simple trees. Unpublished manuscript (1980)
Flajolet,P., Ottmann,Th., and Wood,D.: Search trees, free search trees and bubble memories. In preparation (1980)
Fredman,M.L.: Two applications of a probabilistic search technique: sorting X+Y and building balanced search trees. Proc. 17th Ann. ACM Symposium on Theory of Computing (1975), 240–244
Flajolet,P., and Steyaert,J.M.: On the analysis of tree-matching algorithms. Seventh ICALP 80, (J.W. de Bakker and J. van Leeuwen, ed.), Lecture Notes in Computer Science, Vol.85 (1980), 208–219
Garey, M.R.: Optimal binary search trees with restricted maximal depth. SIAM J. Comput. 2 (1974), 101–110
Guettler,R., Mehlhorn,K., Schneider,W., and Wernet,N.: Binary search trees: average and worst case behavior. Universitaet des Saarlandes, Computer Science Technical Report A-76/2 (1976)
Gotlieb,L.: Optimal muliway search trees. Doctoral Dissertation, University of Toronto (1978)
Gotlieb,L., Kriegel,H.P., Vaishnavi,V.K., and Wood,D.: Optimal multiway search trees. Proc. of the 1979 Johns Hopkins Conference on Information Sciences and Systems (1979), 255–256
Gotlieb,C.C., and Walker,W.A.: A top-down algorithm for constructing nearly optimal lexicographical trees. Graph Theory and Computing (ed. Read,R.C.), Academic Press (1972)
Gotlieb,L., and Wood,D.: The construction of optimal multiway search trees and the monotonicity principle. Int. J. of Comp. Math. (1980), to appear
Guibas, L.J., and Odlyzko, A.M.: Maximal prefix-synchronized codes. SIAM J. Appl. Math. 35 (1978), 401–418
Garsia, A.M., and Wachs, M.L.: A new algorithm for minimum cost binary trees. SIAM J. Comput. 6,4 (1977), 622–642
Halton,J.H.: Statistics of trees. University of Wisconsin-Madison, Computer Science Technical Report 334 (1978)
Horibe, Y.: An improved bound for weight-balanced tree. Information and Control 34 (1977), 148–151
Horibe, Y., and Nemetz, T.O.H.: On the max-entropy rule for a binary search tree. Acta Informatica 12 (1979), 63–72
Hotz, G.: Schranken fuer balanced trees bei ausgewogenen Verteilungen. Theoretical Computer Science 3 (1977),51–59
Huang,S.H.S.: Key comparison optimal 2–3-trees with maximum utilization. Master's dissertation, The University of Texas at Austin (1979)
Huang,S.H.S.: Space and comparison optimal 1–2 brother trees. The University of Texas at Austin, Computer Science Technical Report 386 (1977)
Hu, T.C., Kleitman, D.J., and Tamaki, J.K.: Binary trees optimum under various criteria. SIAM J. Appl. Math. 37 (1979), 246–256
Hu, T.C., and Tucker, A.C.: Optimal computer search trees and variable length alphabetic codes. SIAM J. Appl. Math. 21 (1971),514–532
Itai, A.: Optimum alphabetic trees. SIAM J. Comput. 5 (1976), 9–18
Knott,G.D.: Deletion in binary storage trees. Stanford University Computer Science Technical Report CS-75-491 (1975)
Karlton, P.L., Fuller, S.H., Scroggs, R.E., and Kaehler, E.B.: Performance of height-balanced trees. Commun. ACM 19 (1976), 23–28
Knuth, D.E.: Optimum binary search trees. Acta Informatica 1 (1971), 14–25
Knuth, D.E.: The art of computer programming — Volume 3: Sorting and Searching. Reading, Mass., Addison-Wesley (1973)
Koesler,P., and Ottmann,Th.: An experimental study of insertion schemes for classes of multiway search trees. Int. J. Comp. Math. (1980), to appear
van Leeuwen,J.: On the construction of Huffman trees. Third ICALP (eds. Michaelson and Milner), Edinburgh University Press (1976), 382–410
Larson,J.A., and Walden,W.E.: Comparing insertion schemes used to update 2–3-trees. Unpublished manuscript
Mehlhorn, K.: Nearly optimal binary search trees. Acta Informatica 5 (1975), 287–295
Mehlhorn, K.: A best possible bound for the weighted path length of binary search trees. SIAM J. Comput. 6 (1977) 235–239
Mehlhorn, K.: Dynamic binary search. SIAM J. Comput. 8 (1979), 175–198
Mehlhorn, K.: An efficient algorithm for constructing nearly optimal prefix codes. Universitaet des Saarlandes Computer Science Technical Report A-78/13 (1978)
Mehlhorn,K.: Searching, sorting and information theory. Math. Found. of Comp. Sci., Proc., (ed. J.Becvar), (1979), 131–145
Mehlhorn,K.: A partial analysis of height balanced trees. Universitaet des Saarlandes, Computer Science Technical Report A-79/13 (1979)
Mehlhorn,K.: A new data structure for representing sorted lists. Universitaet des Saarlandes, Computer Science Technical Report A-79/22 (1979)
Mehlhorn,K.: Dynamic data structures. Mathematical Centre Tracts 108 Foundations of Computer Science III, (J.W. de Bakker and J. van Leeuwen, ed.) Amsterdam (1979), 71–96
Maruyama, K.: Index structures for virtual memory-comparison between B-trees and M-trees. IBM Research Report RC5258 (1975)
Miller, R.E., Pippenger, N., Rosenberg, A.L., and Snyder, L.: Optimal 2–3-trees. SIAM J. Comput. 8 (1979), 42–59
Mizoguchi,T.: On required space for random split files. Proc. 17th Ann. Allerton Conference (1979)
Nievergelt, J., Prodels, J., Wong, C.K., and Yue, P.C.: Bounds on the weighted path length of binary trees. Inf. Process. Lett. 1 (1972), 220–225
Nievergelt, J., and Reingold, E.M.: Binary search trees of bounded balance. SIAM J. Comput. 2 (1973), 33–43
Nievergelt,J., and Wong,C.K.: On binary search trees, Information Processing 71, North-Holland Publishing Co., (1972), 91–98
Nievergelt, J., and Wong, C.K.: Upper bounds for the total path length of binary trees. J. ACM 20 (1973), 1–6
Nakamura,T., and Mizoguchi,T.: An analysis of storage utilization factor in block split data structuring scheme. Proc. 4th VLDB Conference (1978)
Odlyzko,A.: Period oscillations of coefficients of power series that satisfy functional equations. Unpublished manuscript (1979)
Olivie,H.: On random son-trees. Int. J. Comp. Math. (1980) to appear
Olivie,H.: A new class of balanced search trees: half-balanced binary search trees. Unpublished manuscript (1980)
Olivie,H.: Doctoral dissertation. University of Antwerp, in preparation (1980).
Ottmann, Th., Rosenberg,A.L., Six,H.W., and Wood,D.: Minimal cost brother trees. SIAM J. Comput. (1980), to appear
Ottmann,Th., and Stucky,W.: Higher order analysis of 1–2 brother trees. BIT (1980), to appear
Ottmann,Th., and Wood,D.: 1–2 brother trees or AVL trees revisited. Comput. J. (1980), to appear
Ottmann,Th., and Wood,D.: A comparison of iterative and defined classes of search trees. In preparation (1980)
Patzak,E.: Dichte 3-weg Baeume. Diplomarbeit, Universitaet Karlsruhe (1978)
Perl, Y., Garey, M.R., and Even, S.: Efficient generation of optimal prefix codes: equiprobable words using unequal cost letters. J. ACM 22 (1975), 202–214
Quitzow, K.H., and Klopprogge, M.R.: Space utilization and access path length in B-trees. Inform. Systems 5 (1980), 7–16
Rissanen, J.: Bounds for weighted balanced trees. IBM J. Res. Dev. 17 (1973), 101–106
Robson, J.M.: The height of binary search trees. Australian Computer Journal 11 (1979), 151–153
Rosenberg, A.L., and Snyder, L.: Minimal-comparison 2–3-trees. SIAM J. Comput. 7 (1978), 465–480
Rosenberg,A.L., and Snyder,L.: Compact B-trees. IBM Research Report RC7343 (1978)
Ruskey,F.: On the average shape of binary trees. SIAM J. Comput. (1980), to appear
Six,H.W.: Search cost optimal brother trees. In preparation (1980)
Schlumberger, M., and Vuillemin, J.: Optimal disc merge patterns, Acta Informatica 3, (1973), 25–35
Unterauer, K.: Dynamic weighted binary search trees. Acta Informatica 11 (1979), 341–362
Vaishnavi,V.K., Kriegel,H.P., and Wood,D.: Optimum multiway search trees. Acta Informatica (1980), to appear
Walker, A., and Wood, D.: Locally balanced binary trees. Comput. J., 19(4), (1976), 322–325
Wessner, R.L.: Optimum alphabetic search trees with restricted maximal height. Inf. Process. Lett. 4 (1976), 90–94
Yao, A.C.C.: On random 2–3-trees. Acta Informatica 9 (1978), 159–170
Zaki,A., and Baer,J.L.: A comparison of query costs in AVL and 2–3-trees. University of Washington Computer Science Technical Report 78-02-01 (1978)
Ziviani,N.: Performance evaluation of symmetric binary B-trees. Unpublished manuscript (1980)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ottmann, T., Six, H.W., Wood, D. (1981). The analysis of search trees: A survey. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_16
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive