MCPcopy Create free account
hub / github.com/TheAlgorithms/Python / right

Method right

data_structures/binary_tree/lazy_segment_tree.py:27–37  ·  view source on GitHub ↗

>>> segment_tree = SegmentTree(15) >>> segment_tree.right(1) 3 >>> segment_tree.right(2) 5 >>> segment_tree.right(12) 25

(self, idx: int)

Source from the content-addressed store, hash-verified

25 return idx * 2
26
27 def right(self, idx: int) -> int:
28 """
29 >>> segment_tree = SegmentTree(15)
30 >>> segment_tree.right(1)
31 3
32 >>> segment_tree.right(2)
33 5
34 >>> segment_tree.right(12)
35 25
36 """
37 return idx * 2 + 1
38
39 def build(
40 self, idx: int, left_element: int, right_element: int, a: list[int]

Callers 3

buildMethod · 0.95
updateMethod · 0.95
queryMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected