I want to create an AVL tree where each node is a pair of values: id1, id2. insertion of the node (a,b) goes as follows : in case a is bigger root first ,then (a,b) is in th
