From 9f83862212716b3e965594b577ede3c7c58595b1 Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Tue, 5 Jun 2018 08:47:52 +0300 Subject: [PATCH] Update README for segment tree. --- src/data-structures/tree/segment-tree/README.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/src/data-structures/tree/segment-tree/README.md b/src/data-structures/tree/segment-tree/README.md index c4b76fbe..67d2fad1 100644 --- a/src/data-structures/tree/segment-tree/README.md +++ b/src/data-structures/tree/segment-tree/README.md @@ -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