Find word frequency from huge text file using self-balancing immutable Binary Search Tree in Java?
<p>I am trying to understand how I may implement a BST that would read huge text files and store the frequency of every word in Java? I'm also trying to make it work in a multi-threaded way, so I believe I'd have to make it thread-safe as well!</p>

<p>EDIT: Thank you for your answers. But I'm looking for Java code wherein we construct the BST as well as add the mentioned functionality, without libraries.</p>