Recursion,Trees and Towers.
Last time around, I was having trouble coming up with recursive solutions and figuring out where exactly it could be used. Now, with the introduction of trees and linked lists, it's becoming easier and
easier to implement recursive code and come up with it all on my own.

The first assignment was mostly simple, except for the last part where we were to implement the way to move the cheeses the fastest. I had some trouble with this, but after a lot of experimenting and referring back to code presented in class, I was able to come up with what I thought was a working solution. It only passed two of the tests on the marker, and was not at the optimal number of moves for higher cheeses, but I'm happy with our performance overall as all tests passed for TOAHModel.

Trees and linked lists were completely new to me. Without the weekly labs, I think I'd be pretty lost on the subject overall. The basic concept of a tree was easy enough, but the implementation of it in python felt foreign to me. However, as with all other things in programming, the more I practiced with them the easier I got. I was certain I was proficient at a decent level when I was able to complete Exercise 3 relatively fast, albeit I only passed two tests, because of a silly naming mistake, that I found shortly after submitting it.

I'm glad we're getting so much hands on practice with these new concepts, as they've helped me get  a good grasp on these new data structures, as well as recursion through repetition.