Compare balanced and unbalanced Binary Search Trees. Learn why skewed trees degrade performance and how balancing keeps operations at O(log n).