Introduction - If you have any usage issues, please Google them yourself
The overlap interval between the tree search algorithm: tree node by increasing the information domain will be red and black tree expansion for the interval tree, and through a given interval i, find the overlap interval between the trees.