Self-balancing binary search tree

A self-balancing binary search tree is a type of tree that stores numbers in a very organized way. Think of a pyramid made up of small cubes where each cube is an individual number. These numbers are stored in such a way that when you look for a specific one, you don't have to search through a lot of boxes to find it. The tree does this by always having a similar number of boxes on each side, almost like balancing a seesaw so that it is even on both sides. This way, you can easily find the box you're looking for quickly.