which of the following (list all that apply) are advantages of a balanced binary search tree over an unbalanced one: 1. it requires less memory 2. it's faster to move from node to node 3. it's faster to search 4. it's less error prone 5. it can hold more types of data