Describe the difference between a binary search tree and a self-balancing binary search tree, like an AVL tree or a Red-Black tree. In what scenarios would you choose one over the other?

A binary search tree maintains an ordered structure with O(h) search time, while self-balancing trees guarantee O(log n). Choose self-balancing trees when frequent insertions and deletions may unbalance the tree.