what distinguishes wavl trees from other types of binary search tree is its use of "ranks". these are numbers, stored with each node, that provide an approximation to the distance from the node to its farthest leaf descendant.