搜索资源列表
SimpleBinaryTreeExample
- 一个简单二叉树类（非本人原创）-a simple binary tree type (I originality)
threading
- 图形化，线索二叉树，我是个初学者，只有这样的程序，见谅-graphics, data structures, I was a beginner, the only way to the procedures forgiven! !
linkedBinaryTree
- 用java实现的LinkedList二叉树，内有测试文件。-used to achieve the LinkedList binary tree, which is testing documents.
二叉树的创建及先序、中序、后序遍历
- 实现数据结构中的二叉树的创建及先序、中序、后序遍历-data structure to create the binary tree and first sequence, sequence, after the preorder
Huffman解码编码
- 使用vc++编写的一个实现huffman编码的程序，适用于数据结构中二叉树的相关程序设计-vc prepared by the use of a realization Huffman coding procedures applicable to the binary tree data structure of the design process
二叉树jian
- 这个程序采用先序建立二叉树，并分别使用递归和非递归算法实现了对该二叉树的先中后序的遍历输出，并给出了一定的使用说明-this procedure was used in order to establish a binary tree respectively, and the use of recursive and non - recursive algorithm of this binary tree after the first sequence which Ergodic outp
C++实现二叉树很好的例子
- 数据结构课程设计内容：模拟二叉排序树，用链表的形式实现二叉树．-curriculum design data structure : two simulated fork sort tree with Chain in the form of a binary tree.
二叉排序树完整版
- 二叉排序数。包括排序，插入，删除，查找。-ranking number two forks. Includes sorting, insert, delete, search.
exmp3_15
- 设计一个应用程序能将一组整数数据按由小到大的顺序存 放在一个连续的整数表（顺序表）中，并能以该顺序表生成 一棵二叉树用于存放有序表中元素-design an application can a group headed by integer data stored in the sequence of consecutive integers a table (Table sequence), and be able to generate the sequence table for
mystruct
- 这是一系列关于二叉树的创建,查找,霍夫曼等数据结构编程,-This is a series of binary tree to create, find, Hoffman data structure programming,
BTREE2006
- 一个非递归建立二差树的算法!输入先序带结束符号的序列建立二叉树!原创-establish two poor tree algorithm! First imported symbols sequence ended with the establishment of the sequence binary tree! Originality
wemjiam
- 这是一个数据结构常用的算法叫huffman编码.是对一棵二叉树进行huffman编码的算法-This is a common data structure called Huffman coding algorithm. For a binary tree for HUF fman Coding Algorithm
TestMatrixOperation
- 在java环境中，二元多项式计算完成计算并演示结果以及以二叉树形式进行存储-the environment, complete binary polynomial terms calculated and results of the demonstration in the form of binary tree storage
erchashu1
- 这是二叉树的排序，使数据结构最基本的一个实现，希望对大家有点帮助-This is a binary tree, in order to make the most basic data structure to achieve one, we hope to help a bit
非递归前序,中序,后序遍历二叉树(优化算法)
- 非递归前序,中序,后序遍历二叉树(优化算法)-before non - recursive sequence, sequence after sequence binary tree traversal (optimization algorithm)
将森林转化为二叉树
- 将森林转化为相应二叉树的算法-conversion of forest to the corresponding binary tree algorithm
判断二叉搜索树
- 判断一棵二叉树是否为二叉搜索树的算法-judge whether a binary tree search for the binary tree algorithm
二叉树的深度
- 用递归求出二叉树的深度-derived using recursive depth of the binary tree
二叉树改进041123
- 输入结点和结点数生成二叉树，可以左遍历，右遍历，后遍历！-input nodes and nodes generate binary tree can traverse left and right traverse, traverse after!
AVL树实现
- 纯C实现的AVL树，Demo是MFC的。非递归的遍历，完全支持添加、删除和搜索节点。设计灵活，容易扩展。以下是API struct tagAvlTree; typedef struct tagAvlTree AvlTree; struct tagAvlNode; typedef struct tagAvlNode AvlNode; struct tagAvlNode { AvlNode *left; AvlNode *right; int32_t height;