Abstract
Binary trees are illustrated and discussed in this chapter. Starting with a general introduction to trees, the chapter first examines binary expression trees along with preorder and in order traversals. Then binary search trees are discussed along with a test program. The complete program uses a generic class to implement a binary search tree.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Streib, J.T., Soma, T. (2017). Binary Trees. In: Guide to Data Structures. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-70085-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-70085-4_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70083-0
Online ISBN: 978-3-319-70085-4
eBook Packages: Computer ScienceComputer Science (R0)