Here's a little implementation of Binary Search Trees, as discussed in lectures. I encourage you to look over the code and understand what's going on. You can also use the client as a study aid, by double checking your understanding of BST algorithms such as traversals.