线段树查询操作思路代码

void query(int id, int l, int r)

{

if(tree[id].left == l &&  tree[id].right == r)

return tree[id].sum;

else

{

int mid = ();

}

}