Binary Search Tree Algorithms

Explore binary search tree algorithms in Go through this GopherCon 2018 conference talk. Dive into the fundamentals of binary trees, their applications, and implementation in Go. Learn how to create an algorithm for ranking and categorizing gophers, utilizing Go's simplicity to focus on algorithmic concepts. Discover the benefits of Go's straightforward approach to data structures and how it enables easier algorithm development. Gain insights into testing and benchmarking techniques to ensure algorithm correctness. Follow along as the speaker demonstrates Go's friendliness towards writing algorithms, providing valuable knowledge applicable to various algorithmic challenges. Perfect for both Go beginners and those new to algorithms, this talk demystifies binary search trees and makes them surprisingly enjoyable to work with.

Introduction
Binary Search Tree
Inserting Values
Testing
Terminology