Describe two advantages of using a binary search tree to store data

Values are stored in the tree in order, no matter what order the values are added the values don’t need to be re-sorted each time a new value is added A binary search can be performed easily without needing to sort the values