a ranked AVL tree, with all the needed methods and stand for wanted complexity

an AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than one, rebalancing is done to restore this property. -an AVL tree is a s