week 5

This week we had an assignment where we create a binary tree using a preorder and inorder traversal.  It was probably the most interesting one so far because this one required more thought than the other ones. This is where recursion helped a lot because the tree can be broken down to its node, left, and right. We also had our first test which was easy enough to do. My mistake was my test case required to test an empty list.