how to delete node from interval tree

Question

I have been reading about interval trees on wikipedia. Does anyone know how to implement the delete method in Java? The link to the delete algorithm is http://en.wikipedia.org/wiki/Interval_tree#Deletion

Answer 1

I suppose psuedocode for deletion using the Centered interval tree approach (which is where the link you used points to) would look something like:

deleteInterval(Node n, Interval i)
{
  n.intervalsDesc.remove(i)
  n.intervalsAsc.remove(i)
  if (i.end < n.value && n.leftChild != null) deleteInterval(n.leftChild, i)
  if (i.begin > n.value && n.rightChild != null) deleteInterval(n.rightChild, i)
}