Simulation-of-dendritic-growth

数据结构的一些基本的相关的试验，如二叉树的遍历，打印，如排序算法，检索算法，动态结构的静态实现实验(Data structures related to some basic tests, such as binary tree traversal, print, such as sorting algorithms, search algorithms, the dynamic structure of the realization of the experimental static)

算法导论的英文版，讲解算法的非常经典的书。(English version of Introduction to Algorithm. A classical book to teach algorithm.)

马踏棋盘的贪心算法，8*8棋盘，基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)

数据结构 二叉树的操作，可以对二叉树进行最基本的操作，先建立二叉树。(The operation of the binary tree, binary tree with the most basic operation, first create a binary tree.)

红黑树 二叉树 性能比较分析 红黑树 二叉树(Red-black tree binary tree performance analysis,)

8_queen问题的一个自创的算法，还不错！(8_queen)

读取数据，统计所得到的文件中每个字母的权值，创建哈夫曼树，哈夫曼编码。哈夫曼解码，解码后内容写入到指定的文件。 读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组，最终可以得到一个存放目标文件内容的数组。 将得到的数组进行字母权值的统计，统计每个字母出现的次数，次数即为每个字母的权值。 将得到的字符数组与权值数组作为创建哈夫曼树的依据，哈夫曼树根据每个字母权值的大小来创建，每个节点，包括权值、父节点、左子、右子和字母本身。 根据哈夫曼树进行编码。形成目标文件的哈夫曼编码，将此编码返回。 根据哈夫曼树得到的数组即为解码数组，解码数组作为解码的结果返回。 写入输出文件，将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入，将数组写入到相应的文件中。 (Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file. Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array. The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter. The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself. According to Huffman coding. The formation of the target file Huffman coding, this code returns. According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)

关于二叉树的一些相关代码，运用链表的形式，求二叉树的高度，结点个数以及叶节点个数(Some of the relevant code on the binary tree, using a linked list, find the height of a binary tree, the number of nodes, and the number of leaf nodes)

哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，

有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)