During the years I worked as a C programmer, I was always fascinated by AVL trees. I remember the first time I debugged the balancing of an AVL tree: it felt like I was looking at something alive. This was also thanks to the Borland C compiler I was using. That experience inspired the game I created. It combines the Tower of Hanoi with the logic of AVL trees. The ability to modify the tree’s structure significantly reduces the number of moves needed to reach the goal.

The game is completely free and playable directly in your brouser (No download required).

I hope it will be useful to students studying data structures and recursive functions.

To implement the game, I used Figma AI, primarily for the graphics.

I wanted to know and can it be used in the field of medical research