Is it possible to implement an AVL tree where we compare the keys with the operator <, which is defined in this manner: Given 2 pairs (a,b) , (c,d): if a
