This week I learned about ways to keep trees balanced like AVL Trees and 2-3 Trees. It was interesting to see how AVL Trees use rotations to stay balanced while 2-3 Trees split nodes when needed. We also worked with heaps, focusing on max heaps. I practiced how to add and remove values while keeping the heap structure in place. The bottom up method using arrays was a bit confusing at first but it started to click after some examples. I also learned how hashing works, including how to handle collisions and when to rehash as the table fills up.

Comments

Popular posts from this blog