Back to Work

AVL Tree Score Keeper

TL;DR:   Score Keeping AVL Tree implementation

AVL Tree Score Keeper thumbnail image

Java AVL Tree Project for Chess Club

In this Java project, I implemented an AVL Self-Balancing Tree to organize chess player rankings by ELO scores. The focus was on ensuring the tree remains balanced through rotations, a crucial aspect of AVL trees. This approach guarantees efficient search, insert, and delete operations, which are vital for managing the fluctuating player data in a chess club. This project highlights my skills in data structure implementation, particularly in maintaining balance in AVL trees for optimal performance.