update cheatsheet

yennanliu · May 12, 2024 · 92d0d4f · 92d0d4f
1 parent f1ca092
commit 92d0d4f
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 1 deletion.
diff --git a/doc/cheatsheet/bfs.md b/doc/cheatsheet/bfs.md
@@ -4,7 +4,7 @@
     - LC 127
     - LC 1730
 - Breadth first, then deep
-- Usually use data structure such as `queue, array`
+- Use data structure : `Queue` (FIFO)
 
 <img src ="https://github.com/yennanliu/CS_basics/blob/master/doc/pic/bfs_2.png"></p>
 

diff --git a/doc/cheatsheet/dfs.md b/doc/cheatsheet/dfs.md
@@ -1,6 +1,7 @@
 # DFS 
 - search algorithm
 - Deep first, then breadth
+- Use data structure : `Stack`   (FILO)
 - To check if some value exists
 - Inorder, preorder, postorder (can recreate a tree)
 - not most efficient (VS bfs), but can handle some specific problems