1. Intro
- Big O-notation
2. Basics
(1) Arrays
(2) Strings
(3) Linked List
(4) Stack
(5) Queue
(6) Time Complexity
(7) Space Complexity
3. Sorting
- Bubble
- Selection
- Insert
- Quick
- Merge
4. Searching
- Linear
- Binary
- Depth-First Seach (DFS)
- Breadth-First Search (BFS)
5. Tree
- Binary Trees
- Tree Traversal
- Binary Search Tree (BST)
- AVL Tree
6. Graph
写在后面:早日整理完,早日开始LC😭