Abstract
Chapter 10 on search methods postponed discussion of binary search directories which may vary dynamically. We shall now remedy that omission. To calculate the average search length of a binary search the set of possible paths through the directory was represented by a binary tree (figure 13.1).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1978 Derek Coleman
About this chapter
Cite this chapter
Coleman, D. (1978). Binary Search Trees. In: A Structured Programming Approach to Data. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-15981-9_13
Download citation
DOI: https://doi.org/10.1007/978-1-349-15981-9_13
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-21943-0
Online ISBN: 978-1-349-15981-9
eBook Packages: Computer ScienceComputer Science (R0)