In several recent posts I’ve presented C# code for a binary search tree where each data value is a (long) integer. Here is some additional code that shows how to traverse a tree in breadth-first and depth-first traversals.