Not really. But you can use O(N) algorithm described in https://www.geeksforgeeks.org/kth-smallestlargest-element-unsorted-array-set-2-expected-linear-time/, or use a handwritten binary search tree that for each node keeps the total number of nodes in the corresponding subtree.

I have to find the Kth largest elememt. Is there any way to find it using TreeSet?

No efficient way for doing this with stock Java TreeSet / TreeMap. And you made me curious whether there is a way of doing it in C++? I cannot find anything useful based on this API: http://www.cplusplus.com/reference/set/set/

UPDATE: found it, now I see the advantage over Java: https://www.geeksforgeeks.org/ordered-set-gnu-c-pbds/