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

Method left

data_structures/binary_tree/lazy_segment_tree.py:15–25  ·  view source on GitHub ↗

>>> segment_tree = SegmentTree(15) >>> segment_tree.left(1) 2 >>> segment_tree.left(2) 4 >>> segment_tree.left(12) 24

(self, idx: int)

Source from the content-addressed store, hash-verified

13 self.flag = [0 for i in range(4 * size)] # flag for lazy update
14
15 def left(self, idx: int) -> int:
16 """
17 >>> segment_tree = SegmentTree(15)
18 >>> segment_tree.left(1)
19 2
20 >>> segment_tree.left(2)
21 4
22 >>> segment_tree.left(12)
23 24
24 """
25 return idx * 2
26
27 def right(self, idx: int) -> int:
28 """

Callers 3

buildMethod · 0.95
updateMethod · 0.95
queryMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected