线段树小笔记

 区间为［a，b］的线段树，深度为h=(int)(log(b-a+1))+1,

则结点总数为：SumNode<=2^(h+1)-1=2^(log(b-a+1)+2)-1;