8000 Update README for segment tree. · sarbbottam/javascript-algorithms@9f83862 · GitHub
[go: up one dir, main page]
Skip to content

Commit 9f83862

Browse files
trekhlebtrekhleb
committed
Update README for segment tree.
1 parent 434a564 commit 9f83862

File tree

1 file changed

+3
-1
lines changed
  • src/data-structures/tree/segment-tree

1 file changed

+3
-1
lines changed

‎src/data-structures/tree/segment-tree/README.md

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,9 @@ can use the precomputed value at the node. Using this
2424
optimisation, we can prove that only `O(log n)` minimum
2525
operations are done.
2626

27-
![Segment Tree](https://www.geeksforgeeks.org/wp-content/uploads/segment-tree1.png)
27+
![Min Segment Tree](https://www.geeksforgeeks.org/wp-content/uploads/RangeMinimumQuery.png)
28+
29+
![Sum Segment Tree](https://www.geeksforgeeks.org/wp-content/uploads/segment-tree1.png)
2830

2931
## Application
3032

0 commit comments

Comments
 (0)
0