more notes and minor fixes

avipars · Mar 17, 2024 · c71c71e · c71c71e
1 parent 78b239f
commit c71c71e
Show file tree

Hide file tree

Showing 2 changed files with 18 additions and 4 deletions.
diff --git a/data_struct/README.md b/data_struct/README.md
@@ -2,7 +2,7 @@
 layout: page
 title: Data Structures and Algorithms
 description: Linked Lists, Trees, Queues, Heaps, Stacks, etc. 
-date: '2022-08-02 12:24:11 -0400'
+date: '2024-03-17'
 permalink: /data_struct/
 image: /static/post-image/bigo.png
 categories: DSA
@@ -30,4 +30,8 @@ Big Oh Notation
 [View Graph](https://www.desmos.com/calculator/dshzbdn2w3)
 
 
-[YouTube Playlist](https://www.youtube.com/playlist?list=PL9DdgseuDZgLEUwB7RnTLNQ-N9x0fn-0a)
+[YouTube Playlist](https://www.youtube.com/playlist?list=PL9DdgseuDZgLEUwB7RnTLNQ-N9x0fn-0a)
+
+[Data Structure Visualizations](https://www.cs.usfca.edu/~galles/visualization/Algorithms.html)
+
+[AlgoVis](https://visualgo.net/en)
diff --git a/data_struct2/README.md b/data_struct2/README.md
@@ -111,11 +111,21 @@ Tree
 - Acyclic and connected graph
 - Connected components of a forest = a tree
 
-Forect
+Forest
 - Acyclic graph
 - a tree is a forest, but a forest isn't always a tree 
 - its a graph and not a set of trees 
 - a subgraph of a forest = always a forest
 
+B-tree
+- Number of keys in each node from ceil(m/2) – 1 to m-1 
+- Number of children = number of keys + 1
+- Minimal number of children = \( \frac{{\lceil \frac{m}{2} \rceil - 1 \cdot (h+1)}}{{\lceil \frac{m}{2} \rceil - 1}} \)
+- Maximal number of children = \( \frac{{m(h+1)}}{{m-1}} \)
 
-[YouTube Playlist](https://www.youtube.com/playlist?list=PL9DdgseuDZgI4iVxPbjXJy4bMG-8DILVq)
+
+[YouTube Playlist](https://www.youtube.com/playlist?list=PL9DdgseuDZgI4iVxPbjXJy4bMG-8DILVq)
+
+[Data Structure Visualizations](https://www.cs.usfca.edu/~galles/visualization/Algorithms.html)
+
+[AlgoVis](https://visualgo.net/en)