Abstract
In this chapter, we present a procedure of multi-stage optimization of binary search trees relative to the weighted average depth and weighted depth. The considered procedure is based on the representation of all possible binary search trees by a directed acyclic graph.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Alnafie, M., Chikalov, I., Hussain, S., Moshkov, M.: Sequential optimization of binary search trees for multiple cost functions. In: Potanin, A., Viglas T. (eds.) Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011, CRPIT, vol. 119, pp. 41–44. Australian Computer Society (2011)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Knuth, D.E.: Optimum binary search trees. Acta Inform. 1(1), 14–25 (1971)
Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching. Monographs in Theoretical Computer Science. An EATCS Series, vol. 1. Springer, Heidelberg (1984)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M. (2019). Binary Search Trees. In: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library, vol 146. Springer, Cham. https://doi.org/10.1007/978-3-319-91839-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-91839-6_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91838-9
Online ISBN: 978-3-319-91839-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)