Compare and contrast the time complexity of different data structures for search operations, such as binary search trees (BST), hash tables, and balanced trees like AVL or Red-Black Trees.

BSTs have an average and worst-case search time complexity of O(log n) and O(n), respectively, depending on their balance. Hash tables offer average O(1) time complexity for search but degrade to O(n) in worst-case scenarios due to collisions. Balanced trees like AVL or Red-Black Trees ensure O(log n) time complexity for search operations by maintaining balanced structures, providing consistent performance across different datasets.