This week we continued on with recursion by exploring self-defined abstract data types. This time with binary trees. Traversing them turns out to be a more complex example of recursion than we've previously used. The exercise for the week proved difficult at first. It left me with a dumb feeling to have worked for hours on what amounted to only a few lines of code, trying to understand how to properly implement traversals.