[Data structs] 二叉树的遍历

Description: The main achievement is to create two branches tree, and use the first and middle traversal to traverse the two fork tree.
Platform: | Size: 1024 | Author: 晴栀菀歌° | Hits:

[Data structs] 哈夫曼树

Description: The main achievement is to create a Huffman tree and output Huffman coding for each node.
Platform: | Size: 1024 | Author: 晴栀菀歌° | Hits:

[Data structs] 有向图邻接表的建立，深度广度搜索及拓扑排序

Description: Topological sort A topological sort for a Directed Acyclic Graph (DAG) G is a linear sequence of all vertices in G, which makes any pair of vertices u and V in the graph, and if the edge (U, V) E (G) appears in the linea
Platform: | Size: 2048 | Author: 晴栀菀歌° | Hits:

[Data structs] 希尔排序

Description: Hill sorting (Shell Sort) is a sort of insertion sort. Also known as narrowing incremental sort, is a more efficient version of the direct insertion sort algorithm. The Hill sort is an unstable sorting algorithm. The met
Platform: | Size: 1024 | Author: 晴栀菀歌° | Hits:

[Data structs] heap

Description: Heap sorting in data structures, building the largest (smallest) heap
Platform: | Size: 1024 | Author: yyuan | Hits:

[Data structs] Sort

Description: A variety of sorting algorithms related to data structure
Platform: | Size: 214016 | Author: 我就是问问 | Hits:

[Data structs] mystack

Description: The stack of array implementation
Platform: | Size: 79872 | Author: numpy | Hits:

[Data structs] 数据结构与算法代码

Description: Solving Joseph problem by chain type
Platform: | Size: 502784 | Author: bjut_Allen | Hits:

[Data structs] MERGE

Description: Algorithm Merge in language C
Platform: | Size: 11264 | Author: marcoaoc | Hits:

[Data structs] ARVORE

Description: Source code of Tree implementation
Platform: | Size: 27648 | Author: marcoaoc | Hits:

[Data structs] 实验2第一个程序

Description: abcdefghigklmnopqrstuvwxyz
Platform: | Size: 1024 | Author: 鱼可爱 | Hits:

[Data structs] Huffman编码树

Description: This method is based on the probability of character appearance to construct the shortest mean length of the head, sometimes called the best encoding, which is generally called the Huffman code.
Platform: | Size: 1024 | Author: PLEASE | Hits: