WAVL tree

A WAVL tree is a type of data structure, like a tree, that helps make finding and storing data quicker and easier. It stands for "Weight-balanced AVL tree". It is like a regular tree, but with some extra balancing features that help make it more efficient. The tree is made up of nodes (points), with each node having three things: a value, a left child, and a right child. It is similar to a binary tree, but with the added feature of being "weight-balanced". This means that for each node, the left and right sides have the same number of nodes (or "weights") for the nodes below it. This makes it much quicker to traverse and sort the data in the tree.