INSERTING AN OBJECT INTO AVL TREE WITH n NODES
AVL tree with nodes forms a tree structure of height log n
now to this tree we are adding an object
When u add a node it might make the tree unbalanced and therefore u have to reorder it which is O(log n)
now ur performing this on a log n height tree
so O(log log n)