Persistent Segment Tree #12186
Persistent Segment Tree #12186
Conversation
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
algorithms-keeper
bot
added
the
require tests
![algorithms-keeper[bot]](https://avatars.githubusercontent.com/in/235834?s=60&v=4){kind=small}
There was a problem hiding this comment.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper reviewto trigger the checks for only added pull request files@algorithms-keeper review-allto trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
| self.roots.append(new_root) | ||
| return len(self.roots) - 1 | ||
|
|
||
| def _update(self, node: Node | None, start: int, end: int, index: int, value: int) -> Node: |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/persistent_segment_tree.py, please provide doctest for the function _update
| """ | ||
| return self._query(self.roots[version], 0, self.n - 1, left, right) | ||
|
|
||
| def _query(self, node: Node | None, start: int, end: int, left: int, right: int) -> int: |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/persistent_segment_tree.py, please provide doctest for the function _query
for more information, see https://pre-commit.ci
algorithms-keeper
bot
removed
the
require tests
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
algorithms-keeper
bot
added
tests are failing
algorithms-keeper
bot
added
the
require tests
There was a problem hiding this comment.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper reviewto trigger the checks for only added pull request files@algorithms-keeper review-allto trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
| self.roots: list[Node] = [] | ||
| self.roots.append(self._build(arr, 0, self.n - 1)) | ||
|
|
||
| def _build(self, arr: list[int], start: int, end: int) -> Node: |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/persistent_segment_tree.py, please provide doctest for the function _build
| node.value = node.left.value + node.right.value | ||
| return node | ||
|
|
||
| def update(self, version: int, index: int, value: int) -> int: |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/persistent_segment_tree.py, please provide doctest for the function update
| self.roots.append(new_root) | ||
| return len(self.roots) - 1 | ||
|
|
||
| def _update(self, node: Node | None, start: int, end: int, index: int, value: int) -> Node: |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/persistent_segment_tree.py, please provide doctest for the function _update
|
|
||
| return new_node | ||
|
|
||
| def query(self, version: int, left: int, right: int) -> int: |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/persistent_segment_tree.py, please provide doctest for the function query
| """ | ||
| return self._query(self.roots[version], 0, self.n - 1, left, right) | ||
|
|
||
| def _query(self, node: Node | None, start: int, end: int, left: int, right: int) -> int: |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/persistent_segment_tree.py, please provide doctest for the function _query
for more information, see https://pre-commit.ci
algorithms-keeper
bot
removed
require tests
for more information, see https://pre-commit.ci
algorithms-keeper
bot
added
tests are failing
The persistent segment tree allows us to efficiently query and update an array while preserving previous versions of the array. The primary operations include:
Build Operation: Constructs the segment tree from the given array. Each node represents a range of the array and stores the sum of that range.
Update Operation: When an update is performed, a new version of the segment tree is created without modifying the existing tree. This is achieved by copying the necessary nodes and updating the affected ranges.
Query Operation: To retrieve the sum of a given range, the segment tree is traversed based on the requested indices. The operation can access multiple versions of the tree to return the correct sum for each version.
Time and Space Complexity:
Time Complexity:
Space Complexity:
Describe your change:
Checklist: