Data structure using C language

This is the data structure of the C language, including common algorithms, etc..

这是数据结构的C语言实现，包括常见的算法等。

1.1 What is a data structure

1.2 What is the algorithm

1.3 Application examples: Maximum subcolumns and questions

2.1 linear list and its implementation

2.2 Stack

2.3 Queue

2.4 Application examples: polynomial additive operation

3.1 Tree and tree represents

3.2 binary and storage structure

3.3 binary tree traversal

3.4 binary search tree

3.5 balanced binary tree

3.6 Exercises selection of linear structures

3.7 heap

3.8 Huffman trees and Huffman coding

3.9 set and computing

4.1 What is the diagram

4.2 Fraph traversal

4.3 Application examples: Rescue 007

4.4 Application examples: Six Degrees of Separation

4.5 Exercise selection of tree

4.6 Shortest Path Problem

4.7 Minimum spanning tree problem

4.8 topological sorting

4.9 Problem figure choice speak

5.1 Simple sort (bubble, insertion)

5.2 Shell sort

5.3 heapsort

5.4 Mergesort

5.5 Quick Sort

5.6 Table Sort

5.7 radix sort

5.8 Comparison of sorting algorithms

6.1 hash table

6.2 Constructor for hash function

6.3 method of handling conflict

6.4 Performance Analysis hash table

6.5 Application examples: frequency statistics

1.1 什么是数据结构

1.2 什么是算法

1.3 应用实例：最大子列和问题

2.1 线性表及其实现

2.2 堆栈

2.3 队列

2.4 应用实例：多项式加法运算

3.1 树与树的表示

3.2 二叉树及存储结构

3.3 二叉树的遍历

3.4 二叉搜索树

3.5 平衡二叉树

3.6 线性结构之习题选讲

3.7 堆

3.8 哈夫曼树与哈夫曼编码

3.9 集合及运算

4.1 什么是图

4.2 图的遍历

4.3 应用实例：拯救007

4.4 应用实例：六度空间

4.5 树之习题选讲

4.6 最短路径问题

4.7 最小生成树问题

4.8 拓扑排序

4.9 图之习题选讲

5.1 简单排序（冒泡、插入）

5.2 希尔排序

5.3 堆排序

5.4 归并排序

5.5 快速排序

5.6 表排序

5.7 基数排序

5.8 排序算法的比较

6.1 散列表

6.2 散列函数的构造方法

6.3 冲突处理方法

6.4 散列表的性能分析

6.5 应用实例：词频统计