Skip to content

grammar #1185

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Oct 27, 2023
Merged

grammar #1185

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/data_structures/segment_tree.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -138,7 +138,7 @@ And if we stop partitioning whenever the query segment coincides with the vertex
### Update queries

Now we want to modify a specific element in the array, let's say we want to do the assignment $a[i] = x$.
And we have to rebuild the Segment Tree, such that it correspond to the new, modified array.
And we have to rebuild the Segment Tree, such that it corresponds to the new, modified array.

This query is easier than the sum query.
Each level of a Segment Tree forms a partition of the array.
Expand Down