http://www.lintcode.com/zh-cn/problem/segment-tree-query-ii/
/**
* Definition of SegmentTreeNode:
* class SegmentTreeNode {
* public:
* int start, end, count;
* SegmentTreeNode *left, *right;
* SegmentTreeNode(int start, int end, int count) {
* this->start = start;
* this->end = end;
* this->count = count;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
*@param root, start, end: The root of segment tree and
* an segment / interval
*@return: The count number in the interval [start, end]
*/
int query(SegmentTreeNode *root, int start, int end) {
// write your code here
if(!root)return 0;
if (root->start>end)return 0;
if (root->end < start)return 0;
if (root->start > start)start = root->start;
if (root->end < end)end = root->end;
if (start == root->start&&end == root->end)return root->count;
SegmentTreeNode *left = root->left, *right = root->right;
if (start >= right->start){//完全在右侧
return query(right, start, end);
}
if (end <= left->end){//完全在左侧
return query(left, start, end);
}
return query(left, start, left->end)+query(right,right->start,end);//在左右之间
}
};