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.
Cite
CITATION STYLE
APA
AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., & Moshkov, M. (2019). Binary search trees. In Intelligent Systems Reference Library (Vol. 146, pp. 245–252). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-319-91839-6_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free