Introduction to Segment Trees - Data Structure and Algorithm Tutorials

Segment tree meaning in DSA

Last Updated : 05 Apr, 2024

A segment tree is a data structure used to effectively query and update ranges of array members. It's typically implemented as a binary tree, with each node representing a segment or range of array elements.

Segment-Tree — Segment tree

Characteristics of Segment Tree:

A segment tree is a binary tree with a leaf node for each element in the array.
Each internal node represents a segment or a range of elements in the array.
The root node represents the entire array.
Each node stores information about the segment it represents, such as the sum or minimum of the elements in the segment.

Types of Segment tree:

Based on the type of information stored in the nodes, the tree can be divided into the following few types:

Sum segment tree: It stores the sum of elements in each segment of the array and is used in a problem where efficient answer queries are needed about the sum of elements.
Min/Max segment tree: It basically stores the minimum or maximum element in each segment of the array.
Range update segment tree / Lazy Tree: It allows you to update a range of array elements with a given value. It is used to efficiently update a range of array elements.

Applications of Segment Tree:

In finding the sum or minimum or maximum of a range of elements in an array.
In finding the number of elements in a range that satisfy a certain condition, such as being greater than a certain value.
It can be used in several problems of computational geometry.

To learn more about applications of segment tree, refer to this article.

Advantages of Segment Tree:

It allows efficient querying and updating of ranges of elements in an array.
It can help in solving a wide range of problems that involve a range of queries or updates.
It has a time complexity of O(logN) for both query and update operations where N is the number of nodes in the tree.

To learn more about advantages of segment tree, refer to this article.

Disadvantages of Segment Tree:

It requires additional memory to store the tree structure and information about the segments
It may not be the most optimal solution for certain problems.

To learn more about the disadvantages of segment tree, refer to this article.

What else can you read?

Introduction to Segment Trees - Data Structure and Algorithm Tutorials

zaidkhan15

Improve

Article Tags :

Practice Tags :

Similar Reads

Segment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree

Segment tree meaning in DSA

A segment tree is a data structure used to effectively query and update ranges of array members. It's typically implemented as a binary tree, with each node representing a segment or range of array elements. Segment tree Characteristics of Segment Tree:A segment tree is a binary tree with a leaf nod

Introduction to Segment Trees - Data Structure and Algorithm Tutorials

A Segment Tree is used to store information about array intervals in its nodes.It allows efficient range queries over array intervals.Along with queries, it allows efficient updates of array items.For example, we can perform a range summation of an array between the range L to R in O(Log n) while al

Persistent Segment Tree | Set 1 (Introduction)

Prerequisite : Segment Tree Persistency in Data Structure Segment Tree is itself a great data structure that comes into play in many cases. In this post we will introduce the concept of Persistency in this data structure. Persistency, simply means to retain the changes. But obviously, retaining the

Segment tree | Efficient implementation

Let us consider the following problem to understand Segment Trees without recursion.We have an array arr[0 . . . n-1]. We should be able to, Find the sum of elements from index l to r where 0 <= l <= r <= n-1Change the value of a specified element of the array to a new value x. We need to d

Iterative Segment Tree (Range Maximum Query with Node Update)

Given an array arr[0 . . . n-1]. The task is to perform the following operation: Find the maximum of elements from index l to r where 0 <= l <= r <= n-1.Change value of a specified element of the array to a new value x. Given i and x, change A[i] to x, 0 <= i <= n-1. Examples: Input:

Range Sum and Update in Array : Segment Tree using Stack

Given an array arr[] of N integers. The task is to do the following operations: Add a value X to all the element from index A to B where 0 ? A ? B ? N-1.Find the sum of the element from index L to R where 0 ? L ? R ? N-1 before and after the update given to the array above.Example: Input: arr[] = {1

Dynamic Segment Trees : Online Queries for Range Sum with Point Updates

Prerequisites: Segment TreeGiven a number N which represents the size of the array initialized to 0 and Q queries to process where there are two types of queries: 1 P V: Put the value V at position P.2 L R: Output the sum of values from L to R. The task is to answer these queries. Constraints: 1 ? N

Applications, Advantages and Disadvantages of Segment Tree

First, let us understand why we need it prior to landing on the introduction so as to get why this concept was introduced. Suppose we are given an array and we need to find out the subarray Purpose of Segment Trees: A segment tree is a data structure that deals with a range of queries over an array.