|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/logn-data-structure-part2/
课程评论：没有评论
**课程名称：** 数据结构 - 第二部分 **课程概述：** 本课程是数据结构系列的第二部分，将深入探讨以下关键主题： * **二叉树 (Binary Trees)** * **二叉搜索树 (Binary Search Trees)** * **树的遍历：** 包括标准遍历方法以及 **Morris 遍历 (Morris Traversal)** (一种无需额外空间栈的遍历方法) * **线索二叉树 (Threaded Binary Trees)** * **平衡二叉树：** 特别是 **AVL 树 (AVL Trees)**，学习如何维护树的平衡以保证高效操作 * **哈夫曼编码 (Huffman Encoding)**，一种高效的数据压缩技术 * **堆 (Heap Data Structure)**，用于实现优先队列等应用 * **不相交集合 (Disjoint Set)**，一种用于处理集合划分问题的有用数据结构 **课程特色：** 本课程注重**可视化教学**，通过大量的图示帮助学员直观理解抽象的数据结构概念，并轻松掌握相关算法与代码实现。 **目标学员：** 即使没有计算机科学背景，只要具备**基础的 Java 编程知识**，都能充分学习本课程。 **教学重点：** 课程不仅讲解数据结构及其算法理论，还将**详细调试代码**，逐行解释代码执行流程，解决学员在代码实现和理解其复杂性过程中的常见难题。 **反馈与建议：** 我们非常欢迎您提供宝贵的**反馈和意见**，并期待您提出希望学习的更多课程主题。
In the second part of Data Structure course, we are going to cover following topics Binary TreesBinary Search TreesTree TraversalMorris TraversalThreaded Binary TreesAVL TreesHuffman EncodingHeap Data StructureDisjoint SetThis course is focused on lots of drawings to help you visualize and help you get comfortable with coding the above mentioned data structures. The materials in this course is put in such a way that an average person without a CS background with some knowledge of basic Java programming. In addition to that, we have explained not only Data Structure and its relevant algorithm, but also the instructor has debugged the code and explained the flow of code line by line. We have experienced that mostly students understand the algorithm but they feel difficulty in understanding the code implementation and its complexity. So, we have given special focused on this point for the convenience students.We would strongly suggest you to please give us your feedback and valuable input.Also, suggest us the topics on which you would like to see more courses.
