Week 6: AVL Trees, 2-3 Trees, Heaps, and Hashing

    This week we learned about AVL trees, 2-3 trees, heaps and heapsort, and hashing. These topics are fundamental to understanding more efficient data management and optimization strategies. AVL trees, which are a type of self-balancing binary search tree. We learned about how these trees maintain balance through rotations to ensure that operations like insertion, deletion, and lookup all remain efficient. 2-3 Trees, a type of search tree where each node can have either two or three children. The structure ensures that the tree remains balanced. Heaps and Heapsort A heap is a specialized tree-based data structure that satisfies the heap property, where a parent node is always greater or smaller than children. heapsort, an efficient sorting algorithm that utilizes the heap data structure. Finally, we learned about hashing, a technique for quickly locating a data record given its search key. This week's puzzle was fun! I initially made a mistake in subtracting 99 - 10 and forgot to add 1 to include the endpoint. Looking forward for next week challenges!