## Let's implement a Binary Search Tree, Part III

For part one, see Let's implement a Binary Search Tree For part two, see Let's implement a Binary Search Tree, Part II At this point in the More »

I'm a father, husband, developer, musician, proud blue-badge wearer, remote worker, ex-CTO and huge nerd.

For part one, see Let's implement a Binary Search Tree For part two, see Let's implement a Binary Search Tree, Part II At this point in the More »

For part one, check out Let's implement a Binary Search Tree Last up, we defined our tree: public class BinarySearchTree { Node _root; public bool Add(int key, More »

A binary search tree is a classic data structure with some pretty great properties; namely O(log(n)) search, insert, and deletion performance. Let's implement one from More »