Uwaterloo SE 390 project group that made an AVL tree library.

Many contest programming problems become easy with such a powerful data structure. Those problems are considered hard because people do not have a canned AVL implementation when writing their solution, and AVL is tricky to implement.

This account is for demonstration purposes only. Please do not use the AVL tree in actual contests, as it would be cheating.