|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/master-data-structures-using-cnet/
课程评论：没有评论
**课程名称：** 使用 C#.Net 精通数据结构 **课程概述：** 本课程将使用 C#.Net 教授所有核心数据结构概念。讲师投入了超过 100 小时精心制作课程，并对每个概念的执行进行了详细讲解。学员可以下载所有源代码和 PowerPoint 演示文稿，并可以随时提问并获得快速解答。 **课程内容涵盖：** * **搜索结构：** * 线性搜索 * 二分搜索 * 递归二分搜索 * **排序算法：** * 冒泡排序 * 选择排序 * 插入排序 * 快速排序 * 归并排序 * **栈 (Stack)：** * 入栈 (Push) * 出栈 (Pop) * 查看栈顶元素 (Peek) * 显示栈（Display operations） * **队列 (Queue)：** * 入队 (Insert) * 出队 (Delete) * 显示队列（Display operations） * **循环队列 (Circular Queue)：** * 循环队列入队 (Insert) * 循环队列出队 (Delete) * 显示循环队列（Display operations） * **双端队列 (Double Ended Queue)：** * 头部插入 (Insert front) * 尾部插入 (Insert rear) * 头部删除 (Delete front) * 尾部删除 (Delete rear) * 从头到尾显示 (Display front to rear) * 从尾到头显示 (Display rear to front) * **链表 (Linked List)：** * 插入 (Insert) * 删除 (Delete) * 显示 (Display) * 搜索元素 (Search Element) * **基于链表的栈 (Stack Using Linked List)：** * 链表入栈 (Push) * 链表出栈 (Pop) * 显示链表栈（Display operations） * **基于链表的队列 (Queue using Linked List)：** * 链表入队 (Insert) * 链表出队 (Delete) * 显示链表队列（Display operations） * **循环链表 (Circular Linked List)：** * 循环链表插入 (Insert) * 循环链表删除 (Delete) * 显示循环链表（Display operations） * **双向链表 (Double Linked List)：** * 双向链表插入 (Insert) * 双向链表删除 (Delete) * 显示双向链表 (Display) * 搜索元素 (Search Element) * **树 (Trees)：** * 二叉树 (Binary Trees) * 二叉搜索树 (Binary Search Trees) * 前序遍历 (PreOrder) * 中序遍历 (InOrder) * 后序遍历 (PostOrder) * 插入元素 (Insert Element) * 删除元素 (Delete Element) * AVL 树 (AVL Trees) * 计算节点高度 (Height of the Element) * 平衡因子 (Balancing Factor) * LL 旋转 (LL Rotation) * RR 旋转 (RR Rotation) * LR 旋转 (LR Rotation) * RL 旋转 (RL Rotation) * **图 (Graphs)：** * 广度优先搜索 (Breadth For Search - BST - [注意：此处概述可能有笔误，通常广度优先搜索为 Breadth-First Search - BFS]) * 深度优先搜索 (Depth For Search - DFS)
In this course you will learn all the Data Structures concepts using C#.net I have spent more than 100 hours to create this course and explained with execution of each concept in detailed, you can download all the source code and Power point presentations, can post any questions and get answered quickly.Searchings Linear Search Binary Search Binary Search With RecursionSorting, Bubble Sort Selection Sort Insertion Sort Quick Sort Merge Sort Stacks Stack Push, Pop, Peek, Display operations.Queues, Queue Insert, Delete, Display operationsCircular Queue Circular Queue Insert, Delete, Display operationsDouble Ended Queue Double ended Queue Insert front, insert rear, Delete front, Delete rear, Display front to rear, Display rear to front operationsLinked List Linked List Insert, Delete, Display, Search Element operations.Stack Using Linked List Stack Linked List Push, Pop, Display operationsQueue using Linked List Queue Linked List Insert, Delete, Display operations.Circular Linked List Circular Linked List Insert, Delete, Display operations.Double Linked List Double Linked List Insert, Delete, Display, Search Element operations.Trees, Binary Trees Binary Search Tress PreOrder InOrder PostOrder Insert Element Delete Element AVL Trees Height of the Element Balancing Factor LL Rotation RR Rotation LR Rotation RL RotationGraphs Breadth For Search (BST) Depth For Search (DFS)
