Is there any way to get index of an element in TreeSet?
I want a data structure(like set in c++) which can handle deletions in O(1) and do search(like lower_bound in c++) in O(logn) time.
Is there any inbuilt data structure in Java which supports the above operations?