This PR improve the space usage of RangeTree2d. The outer tree of RangeTree2d is a non-recursive segment tree. Previously we padded the segment tree size to 2^n. Since there is no binary search operation on the tree, so there is no need to do this padding.
This PR improve the space usage of RangeTree2d. The outer tree of RangeTree2d is a non-recursive segment tree. Previously we padded the segment tree size to 2^n. Since there is no binary search operation on the tree, so there is no need to do this padding.