搜索资源列表
jiapu
- 家谱设计程序 基于c的家谱程序，通过二叉树完成。有的功能不尽完善，不过是自己努力编写完成的。-Genealogy design process based on c, genealogy program, through the complete binary tree. Some features not perfect, but their own efforts in the preparation completed.
C实现二叉树
- 数据结构课程设计内容：模拟二叉排序树，用链表的形式实现二叉树．-curriculum design data structure : two simulated fork sort tree with Chain in the form of a binary tree.
C实现二叉树
- 数据结构课程设计内容：模拟二叉排序树，用链表的形式实现二叉树．-curriculum design data structure : two simulated fork sort tree with Chain in the form of a binary tree.
tree
- 判断是否为完全二叉树，c++编写，运行正常-tree
c.resourse
- 包含五个C源码，分别是：IP地址解析、二叉树算法集、广度优先搜索及深度优先搜索、华氏温度和摄氏温度的相互转换、用for循环模拟自由落体运动。-Contains five C source code, namely: IP address resolution, binary tree algorithm set, breadth-first search and depth-first search, Fahrenheit and Celsius temperature of one anoth
BalenceTwoTree
- 数据结构中的平衡二叉树的C++实现，平衡二叉树可以说是比较难的一点，希望对你有所帮助。-Balanced binary tree data structure in the C++ implementation, balanced binary tree can be said is more difficult point, want to help you.
Algorithm
- C++ 实现的5种排序算法，以及二叉树，红黑树的相关操作和动态规划。-Sort Algorithm, BT RBT , Dynamic Program
FrameC_V0_4
- 1. 这是对之前MyOOCFwV1_0(http://www.pudn.com/downloads229/sourcecode/middleware/detail1079540.html)的完善，解决了之前的bug 2. 新添源码(src目录下)：CharString、链式栈、链式队列、先序二叉树 3. 新添测试代码，放在test目录下 4. 运行环境：Linux + Eclipse IDE for C/C++ Developers-1. This is the improved v
BiSearchTree
- 二叉树的c语言实现，在codeblocks可运行-Binary tree c language implementation, in codeblocks can run
BiSrchTrBalanced
- 平衡二叉树的c语言实现，在codeblocks可运行-Balance binary tree c language implementation, in codeblocks can run
C
- C实现的一些数据结构,包括队列，散列表，栈，二叉树，图的拓扑排序-some data structure in C，including queue,hashtable,stack,tree,graph topsort
text_binarytreeThread_1
- C++中的二叉树的实现程序，并且使之线索化(using visual studio 2013 to realize the binary tree and making it a circle with the thread)
二叉树的比较
- 典型的C++中的排序问题，这是二叉树比较的c++源码(Typical C++ sorting problem, which is the two tree comparison c++ source)
BinaryTree
- 二叉树前序中序后序遍历遍历代码，使用c++编写(Two fork tree preorder, in order, after traversal traversal code, using c++ write)
c二叉查找树
- 二叉树查找算法，是c数据结构的内容比较难做我做了很长时间才做出来(Two tree search algorithm, C data structure is more difficult to do, I have done a long time to do it)
bintree
- 主要为二叉树的遍历，涉及到前序遍历、中序遍历、后序遍历，以及左右孩子的交换后的遍历（内附c&c++操作手册）(It is mainly used for binary tree.)
哈夫曼树
- 哈夫曼树（Huffman tree），又名最优树，指给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman tree)。哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。若将树中结点赋给一个有着某种含义的数值，则这个数值称为该结点的权。(Huffman tree (Huffman tree), also known as the tree, given n as n weights of the leaf node,
test05_333
- 1、 输入一个完全二叉树的层次遍历字符串，创建这个二叉树，输出这个二叉树的前序遍历字符串、中序遍历字符串、后序遍历字符串、结点数目、二叉树高度(上述每一个结果独立一行显示)。 2、 输入二叉树前序序列和中序序列(各元素各不相同)，创建这个二叉树，输出该二叉树的后序序列、层次遍历。(, the input string level traversal of a completely two fork tree, creating the two binary tree, preorder tra
二叉排序树的建立查找插入和删除
- 二叉树的建立，插入，以及排序的完整实现。(The establishment of the two fork tree, insert, sort and complete implementation.)
二叉树遍历操作
- 本代码采用c/c++语言，描述了二叉树的先中后序遍历及深度(This code uses c/c++ language to describe the first and middle traversal traversal and depth of two binary tree.)