in computer science, a wavl tree or weak avl tree is a self-balancing binary search tree. wavl trees are named after avl trees, another type of balanced search tree, and are closely related both to avl trees and red–black trees, which all fall into a common framework of rank balanced trees.