AVL Tree implementation:
I also included a test function to compare the AVL Tree performance with STL Set and Map.
Compile the source mavltree.cpp and run it to see the result!
This code implements min binomial heaps and min leftist trees.Plus, measure and compare the relative performance of these two implementations under the assumption that the only permissible operations are insert and delete-min.
