线段树不是完全二叉树,是平衡二叉树
堆也是平衡二叉树
堆满二叉树:
h层,一共有2^h-1个节点(大约是2^h)
最后一层(h-1层)有2^(h-1)个节点
最后一层的节点数大致等于前面所有层节点之和
如果区间有n个元素,数组表示需要4n的空间
不考虑添加元素,使用4n的静态空间即可
接口:
public interface Merger {
E merge(E a, E b);
}
public class SegmentTree {
private E[] tree;
private E[] data;
private Merger merger;
public SegmentTree(E[] arr, Merger merger){
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[treeIndex] = data[l];
return;
}
int leftTreeIndex = leftChild(treeIndex);
int rightTreeIndex = rightChild(treeIndex);
// int mid = (l + r) / 2;
int mid = l + (r - l) / 2;
buildSegmentTree(leftTreeIndex, l, mid);
buildSegmentTree(rightTreeIndex, mid + 1, r);
tree[treeIndex] = merger.merge(tree[leftTreeIndex], tree[rightTreeIndex]);
}
public int getSize(){
return data.length;
}