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?

What is the difference between a strongly-typed language and a dynamically-typed language, and what are some advantages and disadvantages of each?