title: Removing multiple items from balancing binary tree at once
body: <p>I'm using a red-black binary tree with linked leafs on a project (Java's <code>TreeMap</code>), to quickly find and iterate through the items. The problem is that I can easily get 35000 items or so on the tree, and several times I have to remove "all items above X", which can be almost the entire tree (like 30000 items at once, because all of them are bigger than X), and that takes too much time to remove them and rebalance the tree each time.</p>
  
  <p>Is there any algorithm that can help me here (so I can make my own tree implementation)?</p>