This course is part of the Data Structures and Algorithms Specialization

Junhui DENG

3,600 already enrolled

Offered By

Data Structures and Algorithms SpecializationTsinghua University

About this Course

4,261 recent views

By learning this course, you will get a comprehensive  grasp of stack, queue, binary tree, graph and BST structures and algorithms, as well as their applications. By the end of this course, you will be able to understand and implement stack, queue and binary tree, use binary trees to solve problems such Huffman encoding, understand and implement the graph structure as well as related algorithms such BFS, DFS and PFS, understand and implement  AVL tree.
通过学习本课程，你将全面了解栈、队列、二叉树、图和二叉搜索树结构、算法及其应用。 在本课程结束时，你将能够理解和实现栈、队列和二叉树，使用二叉树解决霍夫曼编码等问题，理解并实现图结构以及相关算法（例如BFS，DFS和PFS），理解并实现AVL树。

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Course 2 of 4 in the

Data Structures and Algorithms Specialization

Intermediate Level

Basic Computer Science and programming skills

Approx. 36 hours to complete

Chinese (Simplified)

What you will learn

Algorithms used to solve complex problems
Principles and methods in the design and implementation of various data structures
Skills for algorithm design and performance analysis
Background on fundamental data structures and recent results

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Course 2 of 4 in the

Data Structures and Algorithms Specialization

Intermediate Level

Basic Computer Science and programming skills

Approx. 36 hours to complete

Chinese (Simplified)

Instructor

Junhui DENG

Professor

Department of Computer Science and Technology

15,651 Learners

4 Courses

Offered by

Tsinghua University

Free online courses from Tsinghua University

Tsinghua University, founded in 1911, is one of the most prestigious universities in Asia. Tsinghua University consists of 19 schools and 55 departments with faculties in science, engineering, humanities, social sciences, architecture, management, law, medicine, arts and design. As China’s leading institution of advanced learning, Tsinghua is dedicated to excellence in education, research, and social services. Tsinghua has approximately 3,200 faculty members and over 35,000 students, including 3,500 international students from 108 countries. Among its 170,000 alumni are many outstanding scholars, successful entrepreneurs, and distinguished statesmen who have been playing important roles in the development of China.

Syllabus - What you will learn from this course

Week1

Week 1

1 hour to complete

第零章

1 hour to complete

5 readings

Week2

Week 2

5 hours to complete

第四章栈与队列

5 hours to complete

33 videos (Total 147 min)

33 videos

04-A-1：栈4m04-A-2：实例3m04-A-3：实现4m04-C1-1：应用1m04-C1-2：算法5m04-C1-3：实现2m04-C2-1：实例2m04-C2-2：尝试3m04-C2-3：构思3m04-C2-4：实现1m04-C2-5：反思3m04-C2-6：拓展3m04-C3-1：混洗3m04-C3-2：计数3m04-C3-3：甄别3m04-C3-4：算法4m04-C3-5：括号2m04-C4-1：把玩5m04-C4-2：构思5m04-C4-3：实例4m04-C4-4：算法框架3m04-C4-5：算法细节7m04-C4-6A：实例A6m04-C4-6B：实例B5m04-C4-6C：实例C6m04-C4-6D：实例D6m04-C5-1：简化3m04-C5-2：体验8m04-C5-3：手工6m04-C5-4：算法5m04-D-1：接口3m04-D-2：实例2m04-D-3：实现5m

12 practice exercises

实例 QUIZ3m应用 QUIZ3m实现 QUIZ3m混洗 QUIZ30m计数 QUIZ3m实例 QUIZ3m简化 QUIZ30m算法 QUIZ3m栈、队列的接口和实现16m进制转换4m栈混洗10m表达式求值15m

Week3

Week 3

9 hours to complete

第五章二叉树

9 hours to complete

42 videos (Total 169 min)

42 videos

05-A-1：动机3m05-A-2：应用1m05-A-3：有根树3m05-A-4：有序树4m05-A-5：路径 + 环路2m05-A-6：连通 + 无环4m05-A-7：深度 + 层次8m05-B-1：表示法1m05-B-2：父亲5m05-B-3：孩子4m05-B-4：父亲 + 孩子2m05-B-5：长子 + 兄弟5m05-C-1：二叉树5m05-C-2：真二叉树3m05-C-3：描述多叉树6m05-D-1：BinNode类5m05-D-2：BinNode接口4m05-D-3：BinTree类2m05-D-4：高度更新5m05-D-5：节点插入2m05-E1-1：转化策略2m05-E1-2：遍历规则3m05-E1-3：递归实现3m05-E1-4：迭代实现（1）1m05-E1-5：实例4m05-E1-6：新思路5m05-E1-7：新构思3m05-E1-8：迭代实现（2）4m05-E1-9：实例4m05-E2-1：递归1m05-E2-2：观察6m05-E2-3：思路4m05-E2-4：构思3m05-E2-5：实现3m05-E2-6：实例4m05-E2-7：分摊分析5m05-E4-1：次序3m05-E4-2：实现1m05-E4-3：实例7m05-E5-1：遍历序列1m05-E5-2：(先序 | 后序) + 中序5m05-E5-3：(先序 + 后序) x 真4m

21 practice exercises

动机 QUIZ30m有序树 QUIZ3m连通+无环 QUIZ30m深度+层次 QUIZ30m父亲 QUIZ3m父亲+孩子 QUIZ30m二叉树 QUIZ3m真二叉树 QUIZ30m描述多叉树 QUIZ30m高度更新 QUIZ3m转化策略 QUIZ30m迭代实现（1） QUIZ3m新思路 QUIZ30m实例 QUIZ3m观察 QUIZ30m实例 QUIZ3m次序 QUIZ30m实例 QUIZ3m(先序|后序)+中序 QUIZ30m树与二叉树20m二叉树的遍历20m

Week4

Week 4

7 hours to complete

第六章图

7 hours to complete

27 videos (Total 130 min)

27 videos

06-A-1：邻接+关联4m06-A-2：无向+有向2m06-A-3：路径+环路4m06-B1-1：接口2m06-B1-2：邻接矩阵+关联矩阵3m06-B1-3：实例2m06-B1-4：顶点和边3m06-B1-5：邻接矩阵3m06-B1-6：顶点静态操作5m06-B1-7：边操作5m06-B1-8：顶点动态操作4m06-B1-9：综合评价5m06-C-1：化繁为简3m06-C-2：策略9m06-C-3：实现4m06-C-4：可能情况3m06-C-5：实例6m06-C-6：多连通3m06-C-7：复杂度7m06-C-8：最短路径3m06-D-1：算法4m06-D-2：框架2m06-D-3：细节3m06-D-4：无向图7m06-D-5：有向图11m06-D-6：多可达域3m06-D-7：嵌套引理4m

17 practice exercises

邻接+关联 QUIZ30m路径+环路 QUIZ30m实例 QUIZ3m顶点静态操作 QUIZ3m顶点动态操作 QUIZ3m综合评价 QUIZ3m化繁为简 QUIZ30m策略 QUIZ30m实例 QUIZ3m复杂度 QUIZ3m算法 QUIZ30m细节 QUIZ30m无向图 QUIZ3m嵌套引理 QUIZ30m图的基本性质12m图在计算机中的表示20m图搜索算法30m

About the Data Structures and Algorithms Specialization

Data structures play a central role in computer science and are the cornerstones of efficient algorithms. This specialization explores the principles and methods in the design and implementation of various data structures. You will learn the essential skills for algorithm design and performance analysis. Topics covered by this specialization range from fundamental data structures to recent research results.

Frequently Asked Questions

When will I have access to the lectures and assignments?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
What will I get if I subscribe to this Specialization?
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
Is financial aid available?
Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.

More questions? Visit the Learner Help Center.

Data Structures and Algorithms (II)

About this Course

What you will learn