AVL-tree Library in C

Introduction to AVL-trees

AVL tree is a self balanced binary search tree. That means, an AVL tree is also a binary search tree but it is a balanced tree. A binary tree is said to be balanced, if the difference between the hieghts of left and right subtrees of every node in the tree is either -1, 0 or +1. In other words, a binary tree is said to be balanced if for every node, height of its children differ by at most one. In an AVL tree, every node maintains a extra information known as balance factor. The AVL tree was introduced in the year of 1962 by G.M. Adelson-Velsky and E.M. Landis. You can find more details in the link below. http://btechsmartclass.com/DS/U5_T2.html

Install cmocka to run the tests (Optionnal)

1. Download cmocka: https://cmocka.org/
2. Extract the archive in /path/cmocka
3. Create a build dir and in this dir call 'make /path/cmocka' followed by 'make'

Some algorithmic problems wich can be solved using AVL-tree

SPOJ

Order statistic set Weird function

UVA

Almost Union-Find

Codeforces

Yet Another Array Queries Problem