Update README for segment tree.

This commit is contained in:
Oleksii Trekhleb 2018-06-05 08:47:52 +03:00
parent 434a5649cb
commit 9f83862212

View File

@ -24,7 +24,9 @@ can use the precomputed value at the node. Using this
optimisation, we can prove that only `O(log n)` minimum
operations are done.
![Segment Tree](https://www.geeksforgeeks.org/wp-content/uploads/segment-tree1.png)
![Min Segment Tree](https://www.geeksforgeeks.org/wp-content/uploads/RangeMinimumQuery.png)
![Sum Segment Tree](https://www.geeksforgeeks.org/wp-content/uploads/segment-tree1.png)
## Application