|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/advanced-data-structures-tree-adt/
课程评论：没有评论
Coursera 课程“高级数据结构 - 第一部分 - 树 ADT”详细介绍了树抽象数据类型 (ADT) 及其各种变体。 课程从**通用树**的入门开始，然后深入探讨**二叉树**，包括其实现、遍历算法以及一个实际应用。 随后，课程将重点介绍二叉树的各种变体，包括： * **二叉搜索树 (BST)**：讨论其基本属性和操作。 * **堆 (Heaps)**：介绍堆的结构和常用操作。 * **平衡二叉搜索树 (Balanced BST)**： * **AVL 树**：深入讲解其保持平衡的机制、属性、操作和应用。 * **红黑树 (Red-Black Trees)**：详述其平衡规则、操作和应用场景。 * **B 树 (B-trees)**：探讨其结构、操作以及在文件系统等领域的应用。 课程**不包含**伪代码或特定编程语言的实现细节。 在适当的地方会提供**练习题/测验**，并对这些问题进行**详细解答**。
This course is intended to discuss in detail about Tree Abstract Data Type and its variants. Starting with basic introduction to General Trees, moves ahead to Binary trees, their implementation, Traversal algorithms and an application of Binary Tree. The variants of Binary Tree , starting from Binary Search Trees, Heaps, then moving into balanced BST - AVL trees, Red-Black trees, B-trees all are discussed in detail with their properties, operations and applications. The course discuss does not cover about pseudo code or about any specific programming language implementation.Practice Problems/quiz are given wherever required and the the solution to these problems is also discussed.
