Journal 36
February 11 - February 19 This week I will be sure to actually click the upload post button, because I somehow forgot to upload what I wrote and missed out on three points because of it. To start, Kung Hei Fat Choy 恭喜發財 you, reader, if you celebrate the holiday. The lectures this week covered balanced trees and hashing. Specifically, we covered AVL trees, 2-3 trees, heaps, and hash tables. Each of these were a review for me, as I took Advanced Data Structures at my local community college. There was quite a bit we covered this week, so I am very glad I had that foundational knowledge from my previous class. We reviewed identifying valid AVL trees by checking BST and balance factors, as well as how to do rotations after insertions. We covered max heaps and performed insertions and deletions while maintaining heap property. In our homework assignments, we got in-depth practice with heap operations and linear probing. I really enjoyed the homework assignments this week,...