week 10

I found assignment 2 part 2 hard, mainly is_regex and figuring out how to work with the different trees. I spent a lot of time on it and learnt more about recursion and making base cases for the simplest cases, as well as breaking bigger problems up into simpler ones. I learnt about not wanting to set a parameter to an empty list, because it gets very complex. Rather to check if there is a list already and if there isn't, then to make one. Also, in the lab this week it was about linked lists and binary tree. What I found difficult about this was manipulating individual nodes and accessing different parts of the lists.