红黑树的扩展结构-区间树-利用区间树来查找某一个区间-Expansion of red-black tree structure- interval trees- using interval tree to find a certain interval

对区间树进行插入，并找到低端点最小重叠区间-Insertion of interval tree, and find low-point minimum overlap interval

随机生成一颗有一千个节点的区间树和一个区间，程序返回树的高度和根节点信息，同时给出与给定区间重叠的节点和具有最小低端点的重叠节点-There are a range of randomly generated tree node and a thousand range, the program returns to the tree height and root information, and gives the given interval overlapping nodes and n

实现有效的区间树查找&删除算法.java实现，编译环境MyEclipse-Implement effective interval tree search & remove algorithm. Java implementation, compile environment is MyEclipse