Let's implement a Binary Search Tree, Part IV

This is the fourth post in this series Let's implement a Binary Search Tree Let's implement a Binary Search Tree, Part II Let's implement a Binary Search More »

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 »

Let's implement a Binary Search Tree, Part II

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 »

Let's implement a Binary Search Tree

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 »