Balanced Binary Search Trees
How a BST performs depends largely on how well balanced it is. If a tree has mostly linear structure, then its worst-case time complexity for searching becomes $O(n)$ instead of $O(log(n))$. In order to balance a tree, rotations are crucial.