CST370: Wk 6 Trees, Heaps, and Hash
So this week we covered AVL trees, max Heaps as well as hashing functions. AVL trees are an interesting way to store data and to actively keep them balance and organized. Heaps are useful to keep the highest value towards the top of the heap. Hashing is interesting to myself in particular when it comes to dicts in python, since there is some kind of hashing function going on behind the scenes.
Comments
Post a Comment