huffman

对于数据结构每一章节的相应的练习题，巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)

说明：  数据结构基本算法实现。包括栈、二叉树基本运算实现，同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)

这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)

这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

根据队列搜索算法的基本思想，现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能，可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of ​ ​ the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)

用控制台实现了经典的数据结构B树，可以通过测试文件.txt加载已有的B树，有插入，删除，查找的功能，加深对数据结构的理解。(Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.)

二叉树的中序遍历，先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)

说明：  还是通讯录系统 增删改查 课程设计 本科学校要求的数据结构课程设计(Or address book CRUD the data structures required by the curriculum design undergraduate schools curriculum design)

常用的算法经典代码，包括快速排序，冒泡排序等各种排序方法，还有二叉树的前序、中序和后序遍历等(The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.)