AVL Tree

In computer science, an AVL tree (Adelson-Velskii and Landis' tree, named after the inventors) is a self-balancing binary search tree, and it was the first such data structure to be invented.
Visualization!
Animation!
Features:
0 **Easy to Adjust the animation progress**;
1 Support code and no code mode;
2 You can switch the two modes for any time;
3 Code Syntax Highlighting;
4 Support operation history, and easy to restore the operation and remove all operation record;
5 Support 0.5x 1.0x 2.0x 4.0x speed rate for animation;
6 You can setting the node-radio, etc.

Supported functions:
1 Random to create a tree;
2 Insert a value;
3 Insert a random value;
4 Delete a value;
5 Delete a random value;
6 Find a Value;
7 Pre-order traversal;
8 In-order traversal;
9 Post-order traversal;

more features are coming soon.....