Why BST is better than binary tree?

Could you elaborate on why BST, or Binary Search Tree, is considered superior to a traditional binary tree? What specific advantages does it offer in terms of performance, efficiency, and data organization that sets it apart? I'm particularly interested in understanding how the self-balancing properties and search capabilities of BSTs contribute to its superiority over conventional binary trees.