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!
A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists.
