Zhejiang University Data Structure Mooc after-school exercises blog record complete solution (c language)

Column link

Zhejiang University Data Structure Mooc After-Class Exercises Column

---

---

Exercise blog link

Largest sub-column and question (20 points)

---

Maximum Subsequence Sum (25分)

---

Binary search (20 points)

---

Combination of two ordered linked list sequences (15 points)

---

Multiplication and addition of unary polynomials (20 points)

---

Reversing Linked List (25分)

---

Pop Sequence (25分)

---

Isomorphism of trees (25 points)

---

List Leaves (25分)

---

Tree Traversals Again (25分)

---

Root of AVL Tree (25分)

---

Complete Binary Search Tree (30分)

---

Operation set of binary search tree (30 points)

---

Path in the heap (25 points)

---

File Transfer (25分)

---

Huffman Codes (30 points)

---

List connected sets (25 points)

---

Saving James Bond - Easy Version (25分)

---

Six degrees of space (30 points)

---

Forwards on Weibo (30分)

---

Harry Potter's exam (25 points)

---

Saving James Bond - Hard Version (30分)

---

Tourism planning (25 points)

---

Road to every village (30 minutes)

---

How Long Does It Take (25分)

---

Key activities (30 points)

---

Sort (on) (25 points)

---

Insert or Merge (25 points) (reproduced)

---

Insertion or Heap Sort (25 points) (reproduced)

---

Statistic years of service (20 points)

---

PAT JUDGE（25分）

---

Sort with Swap(0, i) (25分)

---

Phone chat madman (25 points)

---

Hashing (25分)

---

QQ account application and login (25 points)

---

Hashing - Hard Version (30分)

---

Concluding remarks

The above is
all the problem-making process that I learned from scratch , and it
also includes the analysis of thoughts.
I hope it can be helpful to everyone. It
is also a blog that is convenient for everyone to find. I
will encourage everyone.