Skip to content

Commit 313120f

Browse files
committed
docs: add segment tree image
1 parent ac2b726 commit 313120f

File tree

3 files changed

+4
-0
lines changed

3 files changed

+4
-0
lines changed

README.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -38,6 +38,7 @@ Gradle is used for development.
3838
- [Monotonic Queue](src/main/java/dataStructures/queue/monotonicQueue)
3939
- Segment Tree
4040
- [Stack](src/main/java/dataStructures/stack)
41+
- [Segment Tree](src/main/java/dataStructures/segmentTree)
4142
- [Trie](src/main/java/dataStructures/trie)
4243

4344
## Algorithms
@@ -86,6 +87,7 @@ Gradle is used for development.
8687
* [AVL-tree](src/main/java/dataStructures/avlTree)
8788
* [Trie](src/main/java/dataStructures/trie)
8889
* [B-Tree](src/main/java/dataStructures/bTree)
90+
* [Segment Tree](src/main/java/dataStructures/segmentTree) (Not covered in CS2040s but useful!)
8991
* Red-Black Tree (Not covered in CS2040s but useful!)
9092
* Orthogonal Range Searching (**WIP**)
9193
* Interval Trees (**WIP**)

docs/assets/images/SegmentTree.png

28.9 KB
Loading

src/main/java/dataStructures/segmentTree/README.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,8 @@ Segment Trees are primarily used to solve problems that require answers to queri
55
with the possibility of modifying the array elements.
66
These queries could be finding the sum, minimum, or maximum in a subarray, or similar aggregated results.
77

8+
![Segment Tree](../../../../../docs/assets/images/SegmentTree.png)
9+
810
### Structure
911
(Note: See below for a brief description of the array-based implementation of a segment tree)
1012

0 commit comments

Comments
 (0)