Readme

About this repo

• This repo consists of my notes of datastructures classes taught in University of ZHEJIANG on MOOC.

• Most of the code that this branch contains will be written by C/C++.

• Record C/C++ data structure exercises.

• Summarize the learning content and put forward my own understanding.

---

Content

1. 数据结构与算法学习分析总结

第一章：基本概念

• Lecture 1.1 - 数据结构与算法
• Lecture 1.2 - 递归的思想与应用

第二章：表、栈和队列

• Lecture 2.1 - 抽象数据类型 ADT
• Lecture 2.2 - 表 ADT
• Lecture 2.3 - 堆栈 ADT
• Lecture 2.4 - 队列 ADT
• Lecture 2.5 - 通用链表的实现

第三章：树

• Lecture 3.1 - 树的预备知识
• Lecture 3.2 - 二叉树
• Lecture 3.3 - 查找树 ADT(二叉查找树)
• Lecture 3.4 - AVL树

第四章：优先队列（堆）

• Lecture 4.1 - 堆
• Lecture 4.2 - 哈夫曼树与哈夫曼编码
• Lecture 4.3 - 不相交集 ADT

第五章：图论算法

• Lecture 5.1 - 图

第六章：排序

• Lecture 6.1 - 排序

2. 数据结构与算法分析练习题

1. Complexity

• 01-1 Maxsubsequencesum question (C)
• 01-2 Maximum Subsequence Sum (C)
• 01-3 BinarySearch (C)
• 01-4 RecursiveProject(C++)

2. List

• 02-1 List Merge (C)
• 02-2 List mult add (C)
• 02-3 Reversing Linked List (C)
• 02-4 Pop Sequence (C++)

3. Trees

• 03-1 Tree isomorphism (C)
• 03-2 List Leaves (C++)
• 03-3 Tree Traversals Again (C)
• 04-4 Is Same BinarySearch Tree (C)
• 04-5 Root of AVL_Tree (C)
• 04-6 Complete Binary Search Tree (C)
• 04-7 Binarysearch tree operation set (C)
• 05-7 Heap Path (C)
• 05-8 File Transfer (C)
• 05-9 Huffman Codes (C)

Note style

Code

All code will be marked ```Language ...code... ``` when the lecture is read in raw format. When viewed through Github and Pandoc, it will be color coded based on the language as such:

• C

  #include <stdio.h>
  int main(void){
      char * foo = "bar";
      printf("%s",foo);
      return 0;
  }

  • All C code is Compiled with MinGW.org GCC-6.3.0-1.