segmentTreeMinRange.cpp

void buildTreeMinSum(int *a, int *tree, int start, int end, int treeNode)
{
    if (start == end)
    {
        tree[treeNode] = a[start];
        return;
    }

    int mid = (start + end) / 2;

    buildTreeMinSum(a, tree, start, mid, 2 * treeNode);
    buildTreeMinSum(a, tree, mid + 1, end, (2 * treeNode) + 1);

    tree[treeNode] = min(tree[2 * treeNode], tree[(2 * treeNode) + 1]);
    return;
}