Skip to main content

Loading page content

Build Segment Tree

hard

T: O(n)S: O(n)

State:

Current tree node

Visited tree node

Traversal complete

Rebalanced tree node

Inserted tree node

Rewired / rotated node

Compared tree node

Deleted tree node

No element state is highlighted for this setup step.

Loading visualizer…

Pseudocode

1if start == end: tree[node] = arr[start]; return

2mid = (start + end) / 2

3build(2*node, start, mid)

4build(2*node+1, mid+1, end)

5tree[node] = tree[2*node] + tree[2*node+1]

No pseudocode line selected.

Loading syntax highlighter…

No code line selected.

Preparing step explanation…

Generate steps to inspect the execution log.