Binary search trees are used in sorting algorithms such as tree sort, where all the elements are inserted at once and the tree is traversed at an in-order fashion.
In sorting algorithms such as tree sort, binary search trees are utilized to organize data.  Elements are added at once, and then the tree is traversed systematically from left to right (in-order).