Data Structures and Algorithms (II)
Skills:
Algorithm Basics90%
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树。
Watch on Coursera ↗
(saves to browser)
Sign in to unlock AI tutor explanation · ⚡30
More on: Algorithm Basics
View skill →Related AI Lessons
⚡
⚡
⚡
⚡
7 Funding Opportunities for Startup Founders | May 15, 2026
Medium · Cybersecurity
7 Client Red Flags That Cost Me Thousands (And How to Spot Them in the First Call)
Dev.to · Alfred P
Qoray Launches National Dealer-Owned Electric Mobility Franchise for Last-Mile Transportation
Techpoint Africa
DE LA GENÈSE À L’INSTITUTION: L’ANATOMIE DU PASSAGE DE STARTUP À ENTREPRISE
Medium · Startup
🎓
Tutor Explanation
DeepCamp AI