TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves.
we could check its leaves in terms of algorithm as preorder , midorder or postorder.
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!
