L06 : Lazy Propagation | Segment Tree | CodeNCode

[@mirasnussupov7039]

Thanks for sharing your knowledge and skills 👍

[@almamun.]

Easy to understand,take ❤️

[@yasharthgupta9002]

At 13:45 what if I have to find the sum 5 5 instead of 5 6, the corresponding node in the lazy tree is 0 so wont it return the previous value instead of the new updated value?
Is it that while passing through a given node that is in above case since we pass through node 5 6 and then go down the recursion to reach at that time itself we will update the current 5 6 node from the lazy tree and then go to 5 5 recursively

[@aryanshah17]

amazing