CST370 Week 6
This week I explored AVL trees, learning how they keep balance via rotations when insertions or deletions cause imbalance. I practiced determining valid AVL trees and performing rotations (left, right, left-right, right-left). Then we looked at 2-3 trees, which allow nodes to have 2 or 3 children and help maintain balanced search structure. After that, we studied heaps and heapsort (building max heaps, removing the max, bottom-up heap construction) and their time complexity. Finally, we covered hashing, including collision handling, load factor, and rehashing strategies. Working through the exercises and visual tools really helped solidify these more advanced data structure concepts.
Comments
Post a Comment