#
__
Segment Tree
__

##
1. Introduction

A Segment Tree (ST) is a binary tree that is build on top of an (usually integer) array so that we can solve the Range Min/Max/Sum Query as well as any Range Update Query of this array in O(log **N**) time instead of the naive O(**N**) time. Given an array A of **N** (usually integer) elements, we can build the corresponding RMinQ/RMaxQ/RSumQ Segment Tree in O(**N**) time.