A hybrid data structure implementation in Java that combines Hash Tables and AVL Trees for efficient spell management, built as part of a Data Structures course at Ben-Gurion University.
Note: This project was developed as part of my CS 3345 coursework. It is made public solely as a personal artifact and not intended to serve as an academic reference or solution source.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results