数据结构-线段树（区间树）（Java）

自定义线段树

/**
 * @Author: FangJu
 * @Date: 2019/8/21
 */
public class SegmentTree<E> {
   
    private E[] tree;
    private E[] data;
    private Merger<E> merger;

    public SegmentTree(E[] arr, Merger<E> merger) {
   
        if (merger == null) {
   
            throw new IllegalArgumentException("Require merger is not null.");
        }
        this.merger = merger;
        data = (E[]) new Object[arr.length];
        for (int i = 0; i < arr.length; i++) {
   
            data[i] = arr[i];
        }
        tree = (E[]) new Object[4 * arr.length];
        buildSegmentTree(0, 0, arr.length - 1);
    }

    // 在treeIndex的位置创建表示区间[l...r]的线段树
    private void buildSegmentTree(int treeIndex, int l, int r) {
   
        if (l == r) {
   
            tree