Week 9 Recap!

Hey readers! This week we didn't actually learn that many new things because the test was on Wednesday! The test itself didn't have any question that was too particularly challenging although I was super tired from studying for this course, and the two tests I had the day after. I was so tired I was just sort of slow the entire morning during the test so I'm not exactly sure how I did. It may have made sense in my head but I may have missed some details similarly to how I didn't read a question properly on the first test and ended up skipping something in the question. Hopefully things go okay. The marking scheme in this course is something I'm pretty happy about because the better of my two tests will be weighted more.

Anyways, moving on to things I learnt! This week we only had Monday's class where we looked at mutating methods for a binary search tree, specifically insert and delete. The two methods weren't too hard to implement because we already looked at the binary search tree last week and I already know what the node value had to be relative to its left and right sub tree, which is that the node has to be greater than the values in the left sub tree and less than the values on the right sub tree. With tutorials and everything cancelled I wasn't exactly sure if I was doing the lab correctly so I had to work together with my assignment partner to get everything done! For insertion, the contains method in the lab seemed to check every single node in the tree which isn't really that efficient. We can just search part of the tree because it's in a pretty specific order. For the deletion method I was wondering if there was really anything important in keeping a balanced binary search tree and according to google, there are multiple applications of it such as for priority queues and sets.

That's all I have for this week! The end of the course is coming near and it's almost time for finals,which means its time to go into hardcore study mode! See you readers next week!