AVL TREE FLASH

Adelson-Velskii and Landis’ tree is a self balancing binary tree. To view example of AVL TREE click on read more.

Press any number on flash and press INSERT button to insert that number into AVL TREE, You can perform other operations as deletion, traversing in three orders etc.
From option menu change the balancing option and make use of a simple tree as well.
KEEP CODING 🙂