Built a Python Event Scheduler using: • Heap — next event retrieval • Hash Table — fast lookup • Ordered structure — range queries This project applied Heaps, Hash Tables, and Balanced Trees to support adding, canceling, updating priorities, and querying events efficiently. Great hands-on practice connecting data structures to a real scheduling problem 🚀 #Python #DataStructures #Algorithms #ComputerScience #CSUF

To view or add a comment, sign in

Explore content categories