1. Summary of learning
1. Tree structure mind map
2, tree structure learning experience
1. The binary tree is the most difficult part of the tree. There are many calculation formulas to memorize, which is difficult to understand.
2. The Huffman tree part is also a difficulty, and the connections between these trees are always confused.
3. When playing pta, reading is very good, but if you play it yourself, you can't always play it.
2. PTA experimental work
1. Topic 1:
(2) Design ideas:
(3), code screenshot
(4), submission records
Error: In the process of creating the tree, the condition of str[i]='#' was not determined, which caused the memory to exceed the limit.
2. Topic 2:
(2) Design ideas:
(3), code screenshot
(4), submission records
3. Topic three:
(2), design ideas
(3), code screenshot
(4), submission records
Error: Compilation error is caused by forgetting to submit in c++. other mistakes forgotten
3. The PTA final ranking of this week’s topic set
My student number: 201721123104
Fourth, read the code
Code function: Huffman tree construction and basic operations
Code address: https://blog.csdn.net/move_now/article/details/53398753
Advantages: This code teaches us how to implement Huffman tree construction and basic operations, which is a difficult point.
Five, code Git submission record screenshot
