	Each search, insertion, or deletion in a WAVL tree involves following a single path in the tree and performing a constant number of steps for each node in the path. In a WAVL tree with items that has only undergone insertions, the maximum path length is formula_1. If both insertions and deletions may have happened, the maximum path length is formula_3. Therefore, in either case, the worst-case time for each search, insertion, or deletion in a WAVL tree with data items is .