링크드리스트, 스택, 큐는 적어도 까먹지는 않으므로 skip. Tree부터는 종류가 많아서 뭐가 뭔지 헷갈리더라.
1) Binary Tree
2) Binary Search Tree(BST)
3) AVL Tree
4) Red Black Tree
5) Splay Tree
6) B- Tree
7) B+ Tree
*** BFS / DFS
1) Minimum Spanning Tree
(1) Prim's Algorithm
(2) Kruskal Agorithm
2) Shortest Path
-Single Source
(1) Dijkstra Algorithm
(2) Bellman Ford Algorithm
-All pair
(3) Floyd Warshall Algorithm
3) ETC
(1) Detect Cycle in Directed Graph
(2) Detect Cycle in undirected Graph
(3) Topological Sorting
(4) Finding Connected Components
(5) Finding Al Bridges in Graph
1) Linear Search
2) Binary Search
3) Bubble Sort
4) Insertion Sort
5) Selection Sort
6) Quick Sort
7) Mearge Sort
8) Max Heap Insertion and Deletion
9) Heap Sort
10) Radix Sort / Bucket Sort
11) Shell Sort
12) Counting Sort
13) Radix Sort
잘 읽었습니다. 좋은 정보 감사드립니다.