IntervalTree::deleteNode is slow, because it doesn't use binary search.

[levy]

The current implementation potentially traverses the whole tree to find the node to be deleted.