AVL Tree
Free
1.1.1for iPhone, iPad
Age Rating
AVL Tree 스크린 샷
About 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.....
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.....
Show More
최신 버전 1.1.1의 새로운 기능
Last updated on May 24, 2018
오래된 버전
Compatible for iOS11.
Compatible for iPhoneX.
Show More
Version History
1.1.1
Jul 17, 2013
Compatible for iOS11.
Compatible for iPhoneX.
AVL Tree FAQ
제한된 국가 또는 지역에서 AVL Tree를 다운로드하는 방법을 알아보려면 여기를 클릭하십시오.
AVL Tree의 최소 요구 사항을 보려면 다음 목록을 확인하십시오.
iPhone
iPad
AVL Tree은 다음 언어를 지원합니다. English
