Source code for Data Structure Course in Beijing Normal University
- Chapter 2 - 2.14, 2.17, 2.5
- Chapter 3 - 3.17, 3.18, 3.maze
3.maze = queue / stack / recursion implementation of maze problem.
- Chapter 5 - 5.27 & 5.37, huffmanTree
5.27 and 5.37 have been merged in one solution.
- Chapter 8 - Route Plan (Graph & Dijkstra)
I also wrote a HashMap to map City Name to Integer.
I also also added Foreach function to the ChainList.
- Chapter 7 & 9 - Air Quality Query
Use HashMap to map City Name to Record, judge repetition and etc.
Use SeqList to store all records.
Use Dichotomy(二分法) to search for a range.
Use STL Sort.
// Sorry for my laziness :(