---
title: "Discussion on \"Segment Tree: Range update with lazy propagation\" | Hashnode"
description: "Discussion on \"Segment Tree: Range update with lazy propagation\". When moving from a normal segment tree to a lazy segment tree, the main goal is to support efficient range updates. In a standard segment tree, updating a range [l, r] requires visiting every affected leaf node, which is O(n) in the worst case. Lazy ..."
url: "https://hashnode.com/posts/segment-tree-range-update-with-lazy-propagation/68e24bb2631b3c4f6ae6e77b"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Segment Tree: Range update with lazy propagation](https://abhinandanmishra1.hashnode.dev/segment-tree-range-update-with-lazy-propagation?utm_source=hashnode&utm_medium=feed)

When moving from a normal segment tree to a lazy segment tree, the main goal is to support efficient range updates. In a standard segment tree, updating a range \[l, r\] requires visiting every affected leaf node, which is O(n) in the worst case. Lazy ...

Oct 5, 2025 · 4 min read · abhinandanmishra1.hashnode.dev  
Updated Oct 13, 2025  
Read the article

-   [#segment-tree](https://hashnode.com/tag/segment-tree)
-   [#dsa](https://hashnode.com/tag/dsa)

## Written by

[Abhinandan Mishra](https://hashnode.com/@abhinandanmishra1)

@abhinandanmishra1 · Gorakhpur, India

  
[View profile](https://hashnode.com/@abhinandanmishra1)

Full Stack Developer | Loves Frontend Development

Fullstack Developer | CSS | JavaScript | React | Angular | Web3

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
