When to use BST?

Could you elaborate on the circumstances under which BST, or Binary Search Tree, would be the most suitable data structure to employ? Are there specific use cases or scenarios where BSTs offer significant advantages over other structures like arrays, hash tables, or balanced trees? Understanding when to opt for BSTs is crucial for optimizing algorithms and achieving efficient data management. Could you provide some real-world examples or scenarios where BSTs excel?