docs: add segment tree image

4ndrelim · Mar 27, 2024 · 313120f · 313120f
1 parent ac2b726
commit 313120f
Show file tree

Hide file tree

Showing 3 changed files with 4 additions and 0 deletions.
diff --git a/README.md b/README.md
@@ -38,6 +38,7 @@ Gradle is used for development.
   - [Monotonic Queue](src/main/java/dataStructures/queue/monotonicQueue)
 - Segment Tree
 - [Stack](src/main/java/dataStructures/stack)
+- [Segment Tree](src/main/java/dataStructures/segmentTree)
 - [Trie](src/main/java/dataStructures/trie)
 
 ## Algorithms
@@ -86,6 +87,7 @@ Gradle is used for development.
     * [AVL-tree](src/main/java/dataStructures/avlTree)
     * [Trie](src/main/java/dataStructures/trie)
     * [B-Tree](src/main/java/dataStructures/bTree)
+    * [Segment Tree](src/main/java/dataStructures/segmentTree) (Not covered in CS2040s but useful!)
     * Red-Black Tree (Not covered in CS2040s but useful!)
     * Orthogonal Range Searching (**WIP**)
     * Interval Trees (**WIP**)

diff --git a/docs/assets/images/SegmentTree.png b/docs/assets/images/SegmentTree.png
diff --git a/src/main/java/dataStructures/segmentTree/README.md b/src/main/java/dataStructures/segmentTree/README.md
@@ -5,6 +5,8 @@ Segment Trees are primarily used to solve problems that require answers to queri
 with the possibility of modifying the array elements. 
 These queries could be finding the sum, minimum, or maximum in a subarray, or similar aggregated results.
 
+![Segment Tree](../../../../../docs/assets/images/SegmentTree.png)
+
 ### Structure 
 (Note: See below for a brief description of the array-based implementation of a segment tree)