Skip to content

Instantly share code, notes, and snippets.

@kartikkukreja

kartikkukreja/Building a segment tree.cpp

Last active August 29, 2015 14:09
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save kartikkukreja/5a8d9a7d84682aab7228 to your computer and use it in GitHub Desktop.
Save kartikkukreja/5a8d9a7d84682aab7228 to your computer and use it in GitHub Desktop.
Download ZIP
Building a segment tree
Raw
Building a segment tree.cpp
void buildTree(T arr[], int stIndex, int lo, int hi) {
if (lo == hi) {
nodes[stIndex].assignLeaf(arr[lo]);
return;
}
int left = 2 * stIndex, right = left + 1, mid = (lo + hi) / 2;
buildTree(arr, left, lo, mid);
buildTree(arr, right, mid + 1, hi);
nodes[stIndex].merge(nodes[left], nodes[right]);
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment