I’m working on a project where I frequently need to insert, delete, and lookup elements in a data structure. I’ve been using a simple binary search tree (BST), but I’ve noticed that as the tree becomes unbalanced, the performance degrades significantly, especially for lookups and deletions.