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.
This course is part of the Data Structures and Algorithms Specialization
3,599 already enrolled
Offered By


About this Course
4,222 recent views
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
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
Intermediate Level
Basic Computer Science and programming skills
Approx. 36 hours to complete
Chinese (Simplified)
Offered by
Syllabus - What you will learn from this course
1 hour to complete
第零章
1 hour to complete
5 readings
5 hours to complete
第四章 栈与队列
5 hours to complete
33 videos (Total 147 min)
9 hours to complete
第五章 二叉树
9 hours to complete
42 videos (Total 169 min)
7 hours to complete
第六章 图
7 hours to complete
27 videos (Total 130 min)
About the Data Structures and Algorithms Specialization

Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.