搜索资源列表
二叉树，图，排序，查找代码
- 二叉树，图，查找，排序的几个代码，用c 写的，能运行。不错的程序哦！-binary tree, map, locate, sort of several code used to write c, can run. Good procedures Oh!
C++实现二叉树很好的例子
- 数据结构课程设计内容：模拟二叉排序树，用链表的形式实现二叉树．-curriculum design data structure : two simulated fork sort tree with Chain in the form of a binary tree.
二叉树的高度程序！
- 本文用Ｃ语言实现了求二叉树深度的程序，数据结构采用链表-Using C Language for the depth of procedures binary tree data structure used Chain
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
AVLTree
- 好用的平衡二叉树类库，C++类库编写， 好用的平衡二叉树类库，C++类库编写-AVL tree implementation for C++
a3
- 关于二叉树的C语言编程，描述了二叉树的建立以及二叉树的遍历-On the binary tree of C language programming, described the establishment as well as binary tree binary tree traversal
text_binarytreeThread_1
- C++中的二叉树的实现程序，并且使之线索化(using visual studio 2013 to realize the binary tree and making it a circle with the thread)
二叉树
- 二叉树的基本操作，包括先序中序后序的递归和非递归(Two basic operations of the tree, including the first order, the order, the order of recursive and non recursive)
二叉树的比较
- 典型的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)
bintree
- 主要为二叉树的遍历，涉及到前序遍历、中序遍历、后序遍历，以及左右孩子的交换后的遍历（内附c&c++操作手册）(It is mainly used for binary tree.)
二叉树的实现
- 给出了在全线索二叉树中插入结点和二叉树的算法，然后阐述了这种运算的特点。(This paper gives the algorithms inseting root-node and binary tree in all threaded 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,
二叉排序树的建立查找插入和删除
- 二叉树的建立，插入，以及排序的完整实现。(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.)
ErChashu_CMap
- 基于VISUAL C++ 2010 平台下，完成二叉树的建立，创建，等等，非常适合初学者学习 ，有完整的整份工程，运行即可。(Based on the VISUAL C++ 2010 platform, the completion of the establishment of two fork tree, the creation, and so on, very suitable for beginners to learn, a complete whole project, runni
二叉树
- 利用c++语言实现二叉树算法，并附有注释。可用于数据处理。(The binary tree algorithm is implemented with c language and annotated. Can be used for data processing.)