Week 9 impressions

In terms of material it would seem that week 9 wasn't exactly an abundance of information. Al though there isn't much write about there were some interesting topics about the the binary search tree (BST) involving the insert and delete functions. Initial reaction to the insert function is nothing special, to insert a node into the tree it's pretty straight forward, everything on the left is less, everything on the right is larger. It gets a little more confusing for  the delete function.

My difficulties and frustration come from the delete function as it gets more convoluted and complex when you need to delete a node in the middle of the tree. What happens to the rest of the nodes in the subtree? Do they need to be re inserted into the original tree? Even now the algorithm and code are a little hard to follow for me. I will be playing around more with mutating trees and testing code to get a better grasp on the topic in preparation for the final exam. Not too much to write about due to the midterm, The midterm itself , in my opinion, was harder than the first one but was not a problem if you kept up with lab exercises. Al though people that did not have prior knowledge may have had difficulty with the subject because of lack of labs to the strike.