© 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_9

9. Binary Search Tree

Richard Wiener1  
Colorado Springs, CO, USA

In the previous chapter, we introduced and implemented binary trees and explained the code for traversing and displaying such trees graphically.

In this chapter, we explore an important specialized binary tree, the binary search tree. The goal of a search tree is to organize data to support rapid access to the information stored in the tree. Search trees that are relatively balanced have a logarithmic relationship between the maximum depth of the tree and the number of nodes in the tree and therefore ...

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.