# 112-2 DSAP [![hackmd-github-sync-badge](https://hackmd.io/-reiiyXWRHO4zjpy_io46w/badge)](https://hackmd.io/-reiiyXWRHO4zjpy_io46w) ## PPT筆記 - [Chapter 2 - Abstract Machine](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/rkCsU8Bp6) - [Chapter 3 - Abstract and User-Defined Data Type](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/Hy8YOIS66) - [Chapter 4 - Array and List](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/S1MSF8STp) - [Chapter 5 - Resource Management](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/S1JtvNqyA) - [Chapter 6 - Set, Multi-set and Dictionary](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/BkPgfK0aa) - [Chapter 7 - Collection and Iterator](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/HyNZY2DCT) - [Chapter 8 - Program Efficiency and Asymptotic Notation](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/rJp1n_gXA) - [Chapter 9 - Hash Tables](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/BkFfeib7C) - [Chapter 10 - Recursion](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/BklM11GXC) - [Chapter 11 - Testing and Error Handling](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/rJsnwkM7C) - [Chapter 12 - Basics of Object Oriented Programming](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/rkw_LxfQ0) - [Chapter 13 - Queue and Double-Ended Queue](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/H1w3nNk40) - [Chapter 14 - Stack](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/S1nfULJVC) - [Chapter 15 - Tree](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/BkG8HPkVC) - [Chapter 16 - Heap and Priority Queue](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/rJj4SHgVA) - [Chapter 17 - Binary Search Tree](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/SJU0FIeE0) - [Chapter 18 - AVL Tree](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/H1jComM4R) - [Chapter 19 - Red-Black Tree](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/H1LPwVGNA) - [Chapter 20 - Self-Balancing Search Tree](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/H1jFjHzEA) - [Chapter 21 - Graph](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/SkXYZIzVR) - [Chapter 22 - Disjoint Set](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/SJWmblmEA) - Chapter 23 - Concurrent Data Structure(作業系統) --- * [資結期末考古題](/5Y3msywvQXW7HeMhc7HueQ) * HW1 * HW2 * HW3 * HW4 * HW5 * [Final Project](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/ryXez2aQC) --- ## Visualize * [Trie](https://www.cs.usfca.edu/~galles/visualization/Trie.html ) * [Min Heap](https://www.cs.usfca.edu/~galles/visualization/Heap.html) * [Binary Search Tree ](https://visualgo.net/en/bst) * [AVL Tree](https://visualgo.net/en/bst) * [Red Black Tree](https://www.cs.usfca.edu/~galles/visualization/RedBlack.html) * [B tree](https://www.cs.usfca.edu/~galles/visualization/BTree.html) * [Graph Struture](https://visualgo.net/en/graphds) * [Graph Traversal: BFS/DFS](https://visualgo.net/en/dfsbfs) * [Shortest Path](https://visualgo.net/en/sssp) * [Minimum Spanning Tree ](https://visualgo.net/en/mst) * [Disjoint](https://visualgo.net/en/ufds)
{"description":"View the book with \"<i class=\"fa fa-book fa-fw\"></i> Book Mode\".","contributors":"[{\"id\":\"46e1fd51-42cb-44cb-91a3-6884b30788a8\",\"add\":5280,\"del\":2271}]","title":"112-2 資料結構DSAP"}
Expand menu