if a wavl tree is created only using insertion operations, then its structure will be the same as the structure of an avl tree created by the same insertion sequence, and its ranks will be the same as the ranks of the corresponding avl tree. it is only through deletion operations that a wavl tree can become different from an avl tree. in particular this implies that a wavl tree created only through insertions has height at most formula_1.