In a project I need to remove all objects having key value greater than a certain key (key type is
, if it matters).
As far as I know
implemented in Java is a red-black tree which is a binary search tree. So I should get
when removing a subtree.
But I can't find any method to do this other than making a tail view and remove one by one, which takes
Any good ideas implementing this function? I believe treeMap is the correct dataStructure to use and should be able to do this.
thanks in advance