© The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature 2022
R. WienerGeneric Data Structures and Algorithms in Gohttps://doi.org/10.1007/978-1-4842-8191-8_8

8. Binary Trees

Richard Wiener1  
(1)
Colorado Springs, CO, USA
 

In the previous chapter, we examined hash functions and hash tables and looked at several applications including string searching and the implementation of a Set that utilizes hashing.

In this chapter, we turn our attention to Tree structures. This is the first of several chapters that focus on trees. We introduce binary trees in this chapter. We look at mechanisms for traversing a binary tree. We tackle the challenging problem of graphically displaying a binary tree. To do this, we again use the third-party ...

Get Generic Data Structures and Algorithms in Go: An Applied Approach Using Concurrency, Genericity and Heuristics now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.