mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-19 12:17:35 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update persistent_segment_tree.py

Browse Source
This commit is contained in:
Putul Singh 2024-10-19 16:59:44 +05:30 committed by GitHub
parent fc627f1e5f
commit 4598bc83a2
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 3 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
data_structures/persistent_segment_tree.py
View File

@ -1,13 +1,11 @@
from __future__ import annotations
class Node:
def __init__(self, value: int = 0) -> None:
self.value: int = value
self.left: Node | None = None
self.right: Node | None = None
class PersistentSegmentTree:
def __init__(self, arr: list[int]) -> None:
self.n: int = len(arr)
@ -83,9 +81,7 @@ class PersistentSegmentTree:
new_node.left = node.left # Ensure left node is the same as the original
new_node.right = self._update(node.right, mid + 1, end, index, value)
new_node.value = new_node.left.value + (
new_node.right.value if new_node.right else 0
)
new_node.value = new_node.left.value + (new_node.right.value if new_node.right else 0)
return new_node
@ -124,15 +120,12 @@ class PersistentSegmentTree:
if left <= start and right >= end:
return node.value
mid = (start + end) // 2
return self._query(node.left, start, mid, left, right) + self._query(
node.right, mid + 1, end, left, right
)
return (self._query(node.left, start, mid, left, right) +
self._query(node.right, mid + 1, end, left, right))
# Running the doctests
if __name__ == "__main__":
import doctest
print("Running doctests...")
result = doctest.testmod()
print(f"Ran {result.attempted} tests, {result.failed} failed.")