What is the difference between a binary search tree and a balanced binary search tree, and why might you choose to use one over the other?